2434 search results - page 479 / 487 » Algorithmic Randomness of Closed Sets |
94
Voted
KDD
2008
ACM
15 years 9 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
100
click to vote
KDD
2008
ACM
15 years 9 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
KDD
2006
ACM
15 years 9 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
103
click to vote
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...