Sciweavers

10040 search results - page 1689 / 2008
» On Information Lifecycle Management
Sort
View
193
Voted
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
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...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
228
Voted
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 7 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
234
Voted
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 7 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
191
Voted
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
16 years 7 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
208
Voted
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
Scalable discovery of hidden emails from large folders
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...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
« Prev « First page 1689 / 2008 Last » Next »