5595 search results - page 1026 / 1119 » Comparing Subsumption Optimizations |
146
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
143
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
140
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
116
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
125
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...