Sciweavers

1301 search results - page 3 / 261
» Default Clustering from Sparse Data Sets
Sort
View
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
14 years 7 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...
ICCV
1998
IEEE
13 years 11 months ago
Integrated Surface, Curve and Junction Inference from Sparse 3-D Data Sets
We areinterestedin descriptionsof 3-D data sets,as obtained from stereoor a 3-D digitizer. We thereforeconsideras inputa sparsesetof points, possibly associated with certain orien...
Chi-Keung Tang, Gérard G. Medioni
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
13 years 9 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
PRL
2002
67views more  PRL 2002»
13 years 7 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
NIPS
1997
13 years 8 months ago
Active Data Clustering
Active data clustering is a novel technique for clustering of proximity data which utilizes principles from sequential experiment design in order to interleave data generation and...
Thomas Hofmann, Joachim M. Buhmann