Displaying 20 results from an estimated 600 matches similar to: "Bagged clustering (package e1071)"
2003 Jun 26
1
Bagged clustering and fuzzy c-means
Dear All:
I'm a newbie to R and chemometrics.
Now I'm trying apply bclust on fuzzy c-means like this:
>bc1 <- bclust(iris[,1:4], 3, base.centers=20,iter.base=100,
base.method="cmeans")
Committee Member:
1(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18)(19)(20)Erro
r in bclust(iris[, 1:4], 3, base.centers = 20, iter.base = 100, base.method
=
2005 Mar 09
1
plot(bclust) what is the 2nd plot?
Hi everyone,
Currently i'm trying to understand the bagged clustering algorithm, bclust
{e1071}.
When I run the given example in the help file (as below)
data(iris)
bc1 <- bclust(iris[,1:4], 3, base.centers=5)
plot(bc1)
and plot the bclust object, 2 graphs are produced.
The first is a dendrogram, but what is the second plot? The axes are not
labelled and what do the two
2006 Apr 06
1
for "bclust" in package "e1071"
Hi All,
Could you please help with the error I get from the following codes?
> Library(cluster)
> data(iris)
> bc1 <- bclust(iris[,2:5], 3, base.method="clara", base.centers=5)
Then I got:
"Committee Member:
1(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18)(19)(20)
Error in bclust(iris[, 2:5], 3, base.method = "clara",
2012 Sep 03
2
boxplot - bclust
Hello everybody,
I have a problem with the commando of boxplot -bclust.
http://127.0.0.1:13155/library/e1071/html/boxplot.bclust.html
> data(iris)
> bc1 <- bclust(iris[,1:4], 3, base.centers=5)
Committee Member: 1(1) 2(1) 3(1) 4(1) 5(1) 6(1) 7(1) 8(1) 9(1) 10(1)
Computing Hierarchical Clustering
> boxplot(bc1)
Warnmeldungen:
1: In if (x$datamean) { :
Bedingung hat Länge > 1 und
2002 Jun 13
2
Output of clustering packages
Dear all,
I am sorry because my question is perhaps trivial and is certainly a
detail.
It's related to the output of some clustering package
as mclust and e1071. The output is as follows :
[1] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1
[38] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1
[75] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
2001 Aug 08
2
Library hdarray
Dear everybody!
I m seeking the package named hdarray for the analysis of microarrays
data.
It must not included in the base packages.
Thanks in advance.
Aboubakar Maitournam.
-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html
Send "info", "help", or
2002 Apr 22
2
.RData
Dear all,
I have a version 1.3.1 of R which is under Linux Redhat. I have worked
with it without any problem.
But now when I try to run R, I get the error message as follows :
Error: an xdr real data read error occured
Fatal error: unable to restore saved data in .RData
Thank you in advance and sorry if my question is perhaps simple.
Aboubakar Maitournam.
2001 Dec 13
5
R workspace
Dear all,
I m using R version 1.3.1 under linux (Red Hat).
When i left my session, naturally i have the question
Save workspace image? [y/n/c]?
I said n because I want to remove all the contain of my workspace.
Then I left R with q().
When I open new session I have the R welcome message and
[previously save workspace restored]. By typing ls() I find
what I have normally removed and I want to
2010 May 26
3
cluster analysis and supervised classification: an alternative to knn1?
Hi,
I have a 1.000 observations with 10 attributes (of different types: numeric,
dicotomic, categorical ecc..) and a measure M.
I need to cluster these observations in order to assign a new observation
(with the same 10 attributes but not the measure) to a cluster.
I want to calculate for the new observation a measure as the average of the
meausures M of the observations in the cluster
2004 Feb 02
2
Nearest Neighbor Algorithm in R -- again.
Several of the methods I use for analyzing large data sets, such as
WinGamma: determining the level of noise in data
Relief-F: estimating the influence of variables
depend on finding the k nearest neighbors of a point in a data frame or
matrix efficiently. (For large data sets it is not feasible to compute
the 'dist' matrix anyway.)
Seeing the proposed solution to "[R] distance
2001 Oct 04
0
new version of e1071 on CRAN
A new version of e1071 has been released to CRAN which should be much
easier to install on a lot of platforms because reading/writing PNM
images has been moved to the pixmap package, hence there are no longer
dependencies on external libraries and no configure mechanism.
For the authors,
Fritz Leisch
**********************************************************
Changes in Version 1.2-0:
o
2006 Apr 03
2
about arguments in "bclust"
Hi All,
Just want to make sure, in function "bclust", do the following argument
only have one option?
argument "dist.method" has one option "Euclidian";
argument "hclust.method" has one option "average";
argument "base.method" has one option "kmeans".
Thank you!
[[alternative HTML version deleted]]
2006 Mar 30
2
kmeans: "did not converge in 10 iterations"
Hi All,
I run function "kmeans" to cluster a matrix. But when the matrix size is
big enough, it keeps saying "did not converge in 10 iterations". Could
you explain what it means and if the result is wrong?
And the interesting thing is sometimes this warning happens when the
sample size is around 51200 x 6, sometimes it happens around 30000 x 6.
Does the warning related
2002 May 17
2
Installing R-1.5.0 on Linux
Dear all,
I am sorry in advance because probably my question was already
discussed.
I have installed an R version R-1.3.1 on Linux RedHat 6.2.
As I want to install R-1.5.0, I have first followed a suggestion of
Peter
Dalgaard (mail in FAQ) in order to keep the version R-1.3.1 by renaming
/usr/local/lib/R and /usr/local/bin/R (/usr/local/lib/R-1.3.1 and
/usr/local/bin/R-1.3.1 )and then set
2008 Oct 07
2
masking a regular lat/lon grid to extract map boundaries
Dear R-helpers,
I have lat/lon coordinates of regularly spaced grid points, about 4Km
apart, covering the entire US continental region.
I would like to mask this rectangular grid in order to extract all and
only the grid points within a specific region. Today I want to
extract Montana, say, from this grid, and I am hoping to somehow use
the returned value of the function
1998 May 11
1
R-beta: C/Fortran function not in load table
I have gotten this sort of problem some weeks ago and have solved it
with the mailing list archive. But now I have this problem again with
the class library.
What should I put in library/class/R/zzz.R? Everything I put in that
file leads to the same error message. I'm running 0.61.3 on Linux.
> knn1(train, test, cl)
Error in .C("VR_knn1", as.integer(ntr), as.integer(nte),
2006 Apr 05
1
"partitioning cluster function"
Hi All,
For the function "bclust"(e1071), the argument "base.method" is
explained as "must be the name of a partitioning cluster function
returning a list with the same components as the return value of
'kmeans'.
In my understanding, there are three partitioning cluster functions in
R, which are "clara, pam, fanny". Then I check each of them to
2009 May 16
5
bagged importance estimates in earth problem
I was trying to produced bagged importance estimates of attributes in earth using the caret package with the following commands:
fit2 <- bagEarth(loyalty ~ ., data=model1, B = 10)
bagImpGCV <- varImp(fit2,value="gcv")
My bootstrap estimates are produced however the second command "varImp" produces the following error:
Error in UseMethod("varImp") : no
2004 Jan 27
8
distance between two matrices
Hi all,
Say I have a matrix A with dimension m x 2 and matrix B with
dimension n x 2. I would like to find the row in A that is closest to
the each row in B. Here's an example (using a loop):
set.seed(1)
A <- matrix(runif(12), 6, 2) # 6 x 2
B <- matrix(runif(6), 3, 2) # 3 x 2
m <- vector("numeric", nrow(B))
for(j in 1:nrow(B)) {
d <- (A[, 1] - B[j, 1])^2 + (A[,
2006 Dec 01
0
combining bclust and kkmeans
Hi,
I have a very large dataset of 3008 individuals and 800 numerical variables.
In fact it is a table of 3008 36-monthes multivariated time series that I
would like to classify with an unsupervised algorithm
I had a look at the function kkmeans of e1071 package, which seems to be a
kernel weighted version of the algorithm algorithm, and the bclust from the
same package which does bootstrapping