Sciweavers

1301 search results - page 62 / 261
» Default Clustering from Sparse Data Sets
Sort
View
DATAMINE
2007
101views more  DATAMINE 2007»
13 years 9 months ago
Using metarules to organize and group discovered association rules
The high dimensionality of massive data results in the discovery of a large number of association rules. The huge number of rules makes it difficult to interpret and react to all ...
Abdelaziz Berrado, George C. Runger
CORR
2011
Springer
229views Education» more  CORR 2011»
13 years 4 months ago
"Improved FCM algorithm for Clustering on Web Usage Mining"
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
K. Suresh
WAIM
2005
Springer
14 years 2 months ago
Research Paper Recommender Systems: A Subspace Clustering Approach
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...
Nitin Agarwal, Ehtesham Haque, Huan Liu, Lance Par...
NAA
2004
Springer
117views Mathematics» more  NAA 2004»
14 years 2 months ago
Parallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
Ivan Lirkov
ICPR
2004
IEEE
14 years 10 months ago
Landscape of Clustering Algorithms
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...