Sciweavers

1971 search results - page 26 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 6 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
JGTOOLS
2006
80views more  JGTOOLS 2006»
13 years 7 months ago
A Fast Method for Local Penetration Depth Computation
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
Stephane Redon, Ming C. Lin
PRL
2007
150views more  PRL 2007»
13 years 7 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
SDM
2007
SIAM
187views Data Mining» more  SDM 2007»
13 years 9 months ago
Topic Models over Text Streams: A Study of Batch and Online Unsupervised Learning
Topic modeling techniques have widespread use in text data mining applications. Some applications use batch models, which perform clustering on the document collection in aggregat...
Arindam Banerjee, Sugato Basu
BMCBI
2006
186views more  BMCBI 2006»
13 years 7 months ago
Systematic gene function prediction from gene expression data by using a fuzzy nearest-cluster method
Background: Quantitative simultaneous monitoring of the expression levels of thousands of genes under various experimental conditions is now possible using microarray experiments....
Xiaoli Li, Yin-Chet Tan, See-Kiong Ng