Sciweavers

138 search results - page 16 / 28
» Information Theoretic Clustering of Sparse Co-Occurrence Dat...
Sort
View
ICCD
2003
IEEE
145views Hardware» more  ICCD 2003»
14 years 4 months ago
Care Bit Density and Test Cube Clusters: Multi-Level Compression Opportunities
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
Bernd Könemann
ACMSE
2007
ACM
13 years 11 months ago
Enhancing clustering blog documents by utilizing author/reader comments
Blogs are a new form of internet phenomenon and a vast everincreasing information resource. Mining blog files for information is a very new research direction in data mining. We p...
Beibei Li, Shuting Xu, Jun Zhang
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 9 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
ACMSE
2007
ACM
13 years 11 months ago
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries
Classification and change detection of land cover types in the remotely sensed images is one of the major applications in remote sensing. This paper presents a hierarchical framew...
Jiang Li
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan