4560 search results - page 354 / 912 » Finding Data in the Neighborhood |
163
Voted
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
183
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...
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...
188
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
179
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...