Dear Luigi,
As the others have replied already, you cannot expect a clustering
algorithm to produce exactly the result that you expect intuitively. The
results of clustering algorithms depend largely on the parameters and,
even more importantly, on the distance/similarity measure that is used.
Hi Debra,
As already noted by Boris, the right packages can be found in Bioconductor,
namely Biostrings (for handling sets of sequences and pairwise alignments) and
msa (for multiple alignments; a package I am maintaining). Your question does
not yet clearly indicate to me whether pairwise or
y matrices. For
more details, see the package documentation and the following URLs:
http://www.bioinf.jku.at/software/apcluster/
http://cran.r-project.org/web/packages/apcluster/index.html
Best regards,
Ulrich Bodenhofer
*
/apcluster/index.html
Best regards,
Ulrich Bodenhofer
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bioinformatics
*Johannes Kepler University*
Altenberger Str. 69
4040 Linz, Austria
Tel. +43 732 2468 4526
Fax +43 732
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bioinformatics
*Johannes Kepler University*
Altenberger Str. 69
4040 Linz, Austria
Tel. +43 732 2468 4526
Fax +43 732 2468 4539
bodenho...@bioinf.jku.at <mailto:bodenho...@bioinf.jku.at>
DiGiacomo, Jr.
Best regards,
Ulrich
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bioinformatics
*Johannes Kepler University*
Altenberger Str. 69
4040 Linz, Austria
Tel. +43 732 2468 4526
Fax +43 732 2468
Bodenhofer
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bioinformatics
*Johannes Kepler University*
Altenberger Str. 69
4040 Linz, Austria
Tel. +43 732 2468 4526
Fax +43 732 2468 4539
bodenho...@bioinf.jku.at
http
://www.bioinf.jku.at/software/apcluster/
http://cran.r-project.org/web/packages/apcluster/index.html
Best regards,
Ulrich
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bioinformatics
*Johannes Kepler University*
Altenberger Str
Dear Sachin,
If you need the exemplars for further processing, you can access them
via the 'exemplars' slot of the resulting APResult object. See the
following example:
> apres <- apcluster(negDistMat(r=2), x, details=TRUE)
> apres
APResult object
Number of samples = 150
Number of iter
Hi,
I am using R on Ubuntu 12.10 (64bit). This morning, Ubuntu's software
updater automatically installed updates to R's base system (version
2.15.3; via the CRAN PPA). Now R does not work anymore. Here is what I
get when I simply enter "R" on the shell prompt:
bodenhof FUKUOKA~>R
cannot fin
are/apcluster/>
http://cran.r-project.org/web/packages/apcluster/index.html
<http://cran.r-project.org/web/packages/apcluster/index.html>
Best regards,
Ulrich
----
*Dr. Ulrich Bodenhofer*
Associate Professor
Institute of Bi
Sorry, I forgot to mention the following: all I wrote is only valid as long
as your number of samples is smaller than the number of different words. If
the number of samples exceeds the total number of different words, you
should better use the explicit matrix representation and use some kernel
(e.
Alex,
To avoid the memory issue, you can directly use a "bag of words" kernel
(which corresponds to using the linear kernel on the sparse bag of words
matrix Steve suggested). Just a little toy example how this is done for two
:
> x1 <- c("how", "to", "grow", "tree")
> x2 <- c("where", "to", "go
>
> What do you suggest in order to assign a new observation to a determined
> cluster?
>
As I mentioned already, I would simply assign the new observation to the
cluster to whose exemplar the new observation is most similar to (in a
knn1-like fashion). To compute these similarities, you can use t
Sorry, Joris, I overlooked that you already mentioned daisy() in your
posting. I should have credited your recommendation in my previous message.
Cheers, Ulrich
--
View this message in context:
http://r.789695.n4.nabble.com/cluster-analysis-and-supervised-classification-an-alternative-to-knn1-t
>
> I had a look at the documentation of the package apcluster.
> That's interesting but do you have any example using it with both
> categorical
> and numerical variables? I'd like to test it with a large dataset..
>
Your posting has opened my eyes: problems where both numerical and
categorical f
abanero wrote:
>
> Do you know something like “knn1” that works with categorical variables
> too?
> Do you have any suggestion?
>
There are surely plenty of clustering algorithms around that do not require
a vector space structure on the inputs (like KNN does). I think
agglomerative clustering w
17 matches
Mail list logo