Sciweavers

128 search results - page 14 / 26
» Towards proximity pattern mining in large graphs
Sort
View
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 8 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
SIGCOMM
2009
ACM
14 years 2 months ago
Towards automated performance diagnosis in a large IPTV network
IPTV is increasingly being deployed and offered as a commercial service to residential broadband customers. Compared with traditional ISP networks, an IPTV distribution network (i...
Ajay Anil Mahimkar, Zihui Ge, Aman Shaikh, Jia Wan...
CIKM
2008
Springer
13 years 9 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
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...
CIKM
2010
Springer
13 years 2 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki