894 search results - page 4 / 179 » Learning to cluster using local neighborhood structure |
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Proceedings of IEEE Data Mining, IEEE Press, pp. 581-584, 2002. We describe an interactive way to generate a set of clusters for a given data set. The clustering is done by constr...
MONET
2007
14 years 9 months ago
2007
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
73
Voted
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
119
click to vote
KDD
2012
ACM
13 years 2 days ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...