Sciweavers

74 search results - page 3 / 15
» Pattern Mining in Frequent Dynamic Subgraphs
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 7 months 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
ADMA
2006
Springer
220views Data Mining» more  ADMA 2006»
13 years 11 months ago
Mining and Validation of Localized Frequent Web Access Patterns with Dynamic Tolerance
Mining user profiles is a crucial task for Web usage mining, and can be accomplished by mining frequent patterns. However, in the Web usage domain, sessions tend to be very sparse,...
Olfa Nasraoui, Suchandra Goswami
IFIP12
2007
13 years 7 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 7 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 7 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh