Sciweavers

4085 search results - page 412 / 817
» Benchmarking Data Mining Algorithms
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 5 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
141
Voted
BMCBI
2005
89views more  BMCBI 2005»
15 years 4 months ago
MILANO - custom annotation of microarray results using automatic literature searches
Background: High-throughput genomic research tools are becoming standard in the biologist's toolbox. After processing the genomic data with one of the many available statisti...
Ran Rubinstein, Itamar Simon
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 5 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
KDD
2002
ACM
184views Data Mining» more  KDD 2002»
16 years 5 months ago
The Community of Multimedia Agents
Multimedia data mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project is devoted to creating a community of re...
Gang Wei, Valery A. Petrushin, Anatole Gershman
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 11 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