137
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, d...
190
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We present a class of richly structured, undirected hidden variable models suitable for simultaneously modeling text along with other attributes encoded in different modalities. O...
197
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The web contains lots of interesting factual information about entities, such as celebrities, movies or products. This paper describes a robust bootstrapping approach to corrobora...
208
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
165
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
161
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
168
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
It is often expensive to acquire data in real-world data mining applications. Most previous data mining and machine learning research, however, assumes that a fixed set of trainin...
198
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
185
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
201
click to vote
KDD
2007
ACM
16 years 7 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...