6094 search results - page 1003 / 1219 » Applications of a Color-Naming Database |
174
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
177
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
179
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
187
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
192
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...