670 search results - page 13 / 134 » Intractability and clustering with constraints |
98
Voted
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
79
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
103
click to vote
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
108
click to vote
DIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...