2705 search results - page 380 / 541 » Privacy in Data Mining Using Formal Methods |
183
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
173
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
350
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
185
click to vote
IJSI
2008
15 years 6 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
172
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...