Sciweavers

1976 search results - page 35 / 396
» Predictive Graph Mining
Sort
View
MLG
2007
Springer
14 years 1 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 9 months ago
Discriminative Frequent Pattern Analysis for Effective Classification
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 8 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
14 years 15 days ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han