1836 search results - page 176 / 368 » Mining Clustering Dimensions |
168
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
This paper studies the ensemble selection problem for unsupervised learning. Given a large library of different clustering solutions, our goal is to select a subset of solutions t...
181
Voted
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
178
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
160
click to vote
ICDM
2009
IEEE
16 years 24 days ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
150
click to vote
ICDM
2009
IEEE
16 years 24 days ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...