Sciweavers

122 search results - page 14 / 25
» icdm 2009
Sort
View
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
ICDM
2009
IEEE
97views Data Mining» more  ICDM 2009»
15 years 4 months ago
Hierarchical Probabilistic Segmentation of Discrete Events
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...
Guy Shani, Christopher Meek, Asela Gunawardana
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 4 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
ICDM
2009
IEEE
133views Data Mining» more  ICDM 2009»
15 years 4 months ago
On K-Means Cluster Preservation Using Quantization Schemes
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
Deepak S. Turaga, Michail Vlachos, Olivier Versche...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal