11921 search results - page 2078 / 2385 » Community Information Management |
123
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
150
Voted
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
120
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
137
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
131
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...