Sciweavers

128 search results - page 20 / 26
» Towards proximity pattern mining in large graphs
Sort
View
ICDM
2006
IEEE
107views Data Mining» more  ICDM 2006»
14 years 1 months ago
Improving Grouped-Entity Resolution Using Quasi-Cliques
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
Byung-Won On, Ergin Elmacioglu, Dongwon Lee, Jaewo...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 8 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
DAWAK
2001
Springer
14 years 4 days ago
Towards a Novel OLAP Interface for Distributed Data Warehouses
We present a framework for visualizing remote distributed data sources using a multi-user immersive virtual reality environment. DIVE-ON is a system prototype that consolidates dis...
Ayman Ammoura, Osmar R. Zaïane, Randy Goebel
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...