11 search results - page 1 / 3 » Graph-Modeled Data Clustering: Fixed-Parameter Algorithms fo... |
CIAC
2003
Springer
13 years 10 months ago
2003
Springer
MST
2010
13 years 3 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
SIGMOD
1998
ACM
13 years 9 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
AI
2006
Springer
13 years 5 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
ALMOB
2006
13 years 5 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...