Sciweavers

243 search results - page 3 / 49
» Scalable mining of large disk-based graph databases
Sort
View
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
12 years 1 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 3 days ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 5 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
CIKM
2009
Springer
14 years 5 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
WWW
2009
ACM
14 years 11 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...