152 search results - page 12 / 31 » Finding Consistent Clusters in Data Partitions |
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
110
click to vote
ALMOB
2006
14 years 11 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 ...
106
click to vote
SDM
2007
SIAM
15 years 1 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 ...
NIPS
2008
15 years 1 months ago
2008
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
131
click to vote
TDSC
2010
14 years 10 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...