Sciweavers

652 search results - page 14 / 131
» Accelerated EM-based clustering of large data sets
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 9 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
ML
2006
ACM
13 years 7 months ago
A Unified View on Clustering Binary Data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
14 years 1 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
DAGM
2008
Springer
13 years 9 months ago
Boosting for Model-Based Data Clustering
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
Amir Saffari, Horst Bischof