Internet Archive Scholar
Filters
























63,994 Hits in 5.0 sec

Mining frequent neighborhood patterns in a large labeled graph

Jialong Han, Ji-Rong Wen
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (203.1 kB)
https://web.archive.org/web/20200910092531/https://arxiv.org/pdf/1305.3082v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2013 pre-print arXiv:1305.3082v1 fatcat:73bjrq7rmzcqtjdznaywndqlwy
This paper targets mining patterns in the single-graph setting. We resolve the "DCP-intuitiveness" dilemma by shifting the mining target from frequent subgraphs to frequent neighborhoods.  ...  Experiments on real-life datasets display the feasibility of our algorithms on relatively large graphs, as well as the capability of mining interesting knowledge that is not discovered in prior works.  ...  RELATED WORK Frequent Subgraph Mining The frequent subgraph mining problem is well-investigated by the literatures under the graph-transaction setting.  ... 
doi:10.1145/2505515.2505530 dblp:conf/cikm/HanW13 fatcat:wlmggp5jezho3b2hj7z3uqinim
Multiple Versions
Citation

Jialong Han, Ji-Rong Wen. "Mining frequent neighborhood patterns in a large labeled graph." Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13 (2013) 259-268

Frequent subgraph pattern mining on uncertain graph data

Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (933.5 kB)
https://web.archive.org/web/20170809060212/http://www1.se.cuhk.edu.hk/~hcheng/seg5010/slides/zou_cikm09.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

This paper investigates the problem of mining frequent subgraph patterns from uncertain graph data.  ...  An approximate mining algorithm is proposed to find an approximate set of frequent subgraph patterns by allowing an error tolerance on the expected supports of the discovered subgraph patterns.  ...  To the best of our knowledge, there is no literature to date on mining frequent subgraph patterns from uncertain graph data. This paper is the first one to investigate this problem.  ... 
doi:10.1145/1645953.1646028 dblp:conf/cikm/ZouLGZ09 fatcat:oqeaypns5rga7f2nsogb7am2ey
Citation

Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang. "Frequent subgraph pattern mining on uncertain graph data." Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09 (2009) 583-592

Mining Frequent Patterns in Evolving Graphs

Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, Aristides Gionis
2018 Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (783.8 kB)
https://web.archive.org/web/20200306101556/http://kth.diva-portal.org/smash/get/diva2:1183526/FULLTEXT01

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to nd all the k-vertex subgraphs that appear with frequency greater than a given threshold.  ...  For each streaming se ing, we propose algorithms that can extract a high-quality approximation of the frequent k-vertex subgraphs for a given threshold, at any given time instance, with high probability  ...  Apart from the exact mining algorithms, a line of work focused on approximate mining of frequent subgraphs in a given static graph.  ... 
doi:10.1145/3269206.3271772 dblp:conf/cikm/AslayNMG18 fatcat:uayx53rpmjcivitqlg5wzewdaa
Citation

Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, Aristides Gionis. "Mining Frequent Patterns in Evolving Graphs." Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18 (2018) 923-932

A conversation with Professor Jianzhong Li

Jianzhong Li
2012 SIGKDD Explorations  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (323.6 kB)
https://web.archive.org/web/20170809140128/http://www.kdd.org/exploration_files/V13-02-13-Jianzhong-Li.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

He has also served on the editorial boards for distinguished journals, including Knowledge and Data Engineering, and refereed papers for varied journals and proceedings.  ...  He has authored three books and published more than 200 papers in refereed journals and conference proceedings, such as VLDB Journal, Algorithmica, IEEE Transactions on Knowledge and Data Engineering,  ...  and the problem of mining frequent subgraph patterns is formally stated on uncertain graph data under the probabilistic semantics on the basis of ϕ-frequent probability.  ... 
doi:10.1145/2207243.2207258 fatcat:xflqiph5o5bnxaybhs22sfdy3i
Citation

Jianzhong Li. "A conversation with Professor Jianzhong Li." SIGKDD Explorations 13.2 (2012) 77

A Survey on Assorted Approaches to Graph Data Mining

D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu
2011 International Journal of Computer Applications  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (210.6 kB)
https://web.archive.org/web/20170814073149/http://www.ijcaonline.org/volume14/number1/pxc3872294.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

These are used to extract patterns, trends, classes, and clusters from graphs.  ...  We investigate recurring patterns in real-world graphs, to gain a deeper understanding of their structure.  ...  Among various kinds of graph patterns, frequent substructures are very basic ones that can be discovered in a set of graphs.  ... 
doi:10.5120/1806-2294 fatcat:nmup6n2fkzbqxcc67af6u4dnui
Citation

D. Kavitha, B.V. Manikyala Rao, V.Kishore Babu. "A Survey on Assorted Approaches to Graph Data Mining." International Journal of Computer Applications 14.1 (2011) 43-46

Mining closed relational graphs with connectivity constraints

Xifeng Yan, X. Jasmine Zhou, Jiawei Han
2005 Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (81.3 kB)
https://web.archive.org/web/20100615152419/http://www.cs.uiuc.edu/homes/hanj/pdf/icde05_conngraph.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL. The file type is application/pdf.

Since frequent graph mining usually generates too many patterns, it is more appealing to mine closed frequent graphs only [4] .  ...  Through our study, a new research area in frequent graph mining is exposed, where the previous algorithms on single graph mining should be re-examined for pattern discovery in multiple relational graphs  ... 
doi:10.1145/1081870.1081908 dblp:conf/kdd/YanZH05 fatcat:ozvmwpxaujgttixnsfq6blb6eu
Citation

Xifeng Yan, X. Jasmine Zhou, Jiawei Han. "Mining closed relational graphs with connectivity constraints." Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05 (2005) 324-333

cgSpan: Pattern Mining in Conceptual Graphs

Adam Faci
2021 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (551.5 kB)
https://web.archive.org/web/20211031104207/https://arxiv.org/pdf/2110.15058v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Conceptual Graphs (CGs) are a graph-based knowledge representation formalism. In this paper we propose cgSpan a CG frequent pattern mining algorithm.  ...  rules, applying them during the pattern mining process.  ...  cgSpan: a CG Frequent Pattern Mining Algorithm cgSpan is the first frequent pattern mining method running on Conceptual Graphs, to the best of our knowledge.  ... 
arXiv:2110.15058v1 fatcat:ddgdc7phlfgytfhwa77egwxaam
Citation

Adam Faci. "cgSpan: Pattern Mining in Conceptual Graphs." arXiv (2021)

Mining Summaries for Knowledge Graph Search

Qi Song, Yinghui Wu, Xin Luna Dong
2016 2016 IEEE 16th International Conference on Data Mining (ICDM)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (3.2 MB)
https://web.archive.org/web/20170519115952/http://eecs.wsu.edu:80/~qsong/Files/paper/ICDM2016_slide.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Kalnis.GRAMI: frequent subgraph and pattern mining in a single large graph.  ...  graph summarization 5/11 Informativeness Difference approximation algorithm approxDis: • Mining frequent patterns based on d-similarity • Calculate pair-wise score and select top score pairs  ... 
doi:10.1109/icdm.2016.0162 dblp:conf/icdm/SongWD16 fatcat:xnmpqxkgyrdkjkh6hlzkvsttaq
Citation

Qi Song, Yinghui Wu, Xin Luna Dong. "Mining Summaries for Knowledge Graph Search." 2016 IEEE 16th International Conference on Data Mining (ICDM) (2016) 1215-1220

A New Web Usage Mining Approach for Website Recommendations Using Concept Hierarchy and Website Graph

T. Vijaya Kumar, H. S. Guruprasad, Bharath Kumar K. M., Irfan Baig, Kiran Babu S.
2014 International Journal of Computer and Electrical Engineering  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.0 MB)
https://web.archive.org/web/20181030053359/http://www.ijcee.org/papers/796-X10219.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

Along with the server access log file, we incorporate Website knowledge (i.e., Concept hierarchy and Website Graph) into the web usage mining phases. This incorporation can lead to superior patterns.  ...  Index Terms-Concept based website graph, concept hierarchy, web mining, web usage mining, website graph.  ...  It involves usual steps of Web Usage Mining such as Data Gathering, Preprocessing, Pattern Discovery, and Pattern Analysis. Our model incorporates website knowledge in web usage mining techniques.  ... 
doi:10.7763/ijcee.2014.v6.796 fatcat:wnqo7evkgbeqdft7ld3pdcjbpi
Citation

T. Vijaya Kumar, H. S. Guruprasad, Bharath Kumar K. M., Irfan Baig, Kiran Babu S.. "A New Web Usage Mining Approach for Website Recommendations Using Concept Hierarchy and Website Graph." International Journal of Computer and Electrical Engineering (2014) 67-71

Information retrieval and knowledge discovery on the semantic web of traditional chinese medicine

Zhaohui Wu, Tong Yu, Huajun Chen, Xiaohong Jiang, Yi Feng, Yuxin Mao, Heng Wang, Jingming Tang, Chunying Zhou
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.7 MB)
https://web.archive.org/web/20110629024225/http://www2008.org/papers/pdf/p1085-yuA.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL. The file type is application/pdf.

mining methodology is implemented for discovering and interpreting interesting patterns from this network.  ...  relational databases to the Semantic Web layer for query and search across database boundaries; the first global herb-drug interaction network is mapped through semantic integration, and the semantic graph  ...  We presented an in-use Semantic Web platform supporting large-scale database integration, information retrieval, and knowledge discovery for Traditional Chinese Medicine domain.  ... 
doi:10.1145/1367497.1367668 dblp:conf/www/WuYCJFMWTZ08 fatcat:csq7geprxzdgtmsv3yhkxd22gu
Citation

Zhaohui Wu, Tong Yu, Huajun Chen, Xiaohong Jiang, Yi Feng, Yuxin Mao, Heng Wang, Jingming Tang, Chunying Zhou. "Information retrieval and knowledge discovery on the semantic web of traditional chinese medicine." Proceeding of the 17th international conference on World Wide Web - WWW '08 (2008) 1085-1086

Graph Mining and Graph Kernels

Karsten Michael Borgwardt, Xifeng Yan
2008 Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (88.8 kB)
https://web.archive.org/web/20170809102234/http://www.cs.ucsb.edu/~xyan/tutorial/TUTORIAL.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Various groups within the KDD community have begun to study the task of data mining on graphs, including researchers from database-oriented graph mining, and researchers from kernel machine learning.  ...  Social and biological networks have led to a huge interest in data analysis on graphs.  ...  Graph Mining • Frequent graph pattern mining • Contrast graph pattern mining* • Constrained graph pattern mining • Optimal graph pattern mining* • Graph mining in single graphs* • Graph pattern summarization  ... 
doi:10.1145/1401890.1551565 fatcat:xpx2t6gq4ngcvisvqblh4bnwb4
Citation

Karsten Michael Borgwardt, Xifeng Yan. "Graph Mining and Graph Kernels." Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08 (2008)

A Comparative Study Of Frequent Subgraph Mining Algorithms

K Lakshmi
2012 International Journal of Advanced Information Technology  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (347.6 kB)
https://web.archive.org/web/20160527194206/http://airccse.org:80/journal/ijitcs/papers/3212ijitcs03.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL. The file type is application/pdf.

Mining patterns from graph databases is challenging since graph related operations, such as subgraph testing, generally have higher time complexity than the corresponding operations on itemsets, sequences  ...  In this paper we present a detailed survey on frequent subgraph mining algorithms, which are used for knowledge discovery in complex objects and also propose a frame work for classification of these algorithms  ...  approximate network patterns, which is the key for many knowledge discovery applications on structural data, but also enriches the library of graph mining methodologies by introducing several novel techniques  ... 
doi:10.5121/ijitcs.2012.2203 fatcat:qpsc44az4nhafmuekhbngp2eci
Szczepanski
Citation

K Lakshmi. "A Comparative Study Of Frequent Subgraph Mining Algorithms." International Journal of Advanced Information Technology 2.2 (2012) 23-39

Mining Substructures in Protein Data

Fedja Hadzic, Tharam S. Dillon, Amandeep S. Sidhu, Elizabeth Chang, Henry Tan
2006 Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (257.9 kB)
https://web.archive.org/web/20070901210417/http://staff.it.uts.edu.au/~henryws/publications/hadzicf_dmb_06.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL. The file type is application/pdf.

Obtaining the set of frequent induced subtrees from the Prions database can potentially reveal some useful knowledge.  ...  In this work we apply the algorithm to the Prions database in order to extract the frequently occurring patterns, which in this case are of induced subtree type.  ...  Frequent pattern analysis has been a focused theme of study in data mining, and a lot of algorithms and methods have been developed for mining frequent patterns, sequential patterns and structural patterns  ... 
doi:10.1109/icdmw.2006.114 dblp:conf/icdm/HadzicDSCT06 fatcat:7ebzkdbbnvg2pd7uiqhxhbbqai
Citation

Fedja Hadzic, Tharam S. Dillon, Amandeep S. Sidhu, Elizabeth Chang, Henry Tan. "Mining Substructures in Protein Data." Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) (2006) 213-217

Indexing and mining topological patterns for drug discovery

Sayan Ranu, Ambuj K. Singh
2012 Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (105.3 kB)
https://web.archive.org/web/20120712165035/http://www.uweb.ucsb.edu/~sayan/publications/edbt_tutorial.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL. The file type is application/pdf.

As a result, the problem of indexing and mining structural patterns map to indexing and mining patterns from graph and 3D geometric databases.  ...  Next, we will introduce the problem of mining frequent subgraph patterns along with some of their limitations that ignited the interest in the problem of mining statistically significant subgraph patterns  ...  The tutorial will highlight one key weakness in frequent subgraph patterns that resulted in much enthusiasm towards solving the problem of mining statistically significant subgraph patterns.  ... 
doi:10.1145/2247596.2247666 dblp:conf/edbt/RanuS12 fatcat:eik3d5yoxnauzjeukeb6uhdm2u
Citation

Sayan Ranu, Ambuj K. Singh. "Indexing and mining topological patterns for drug discovery." Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12 (2012) 562-565

Discovering Complex Knowledge in Massive Building Operational Data Using Graph Mining for Building Energy Management

Cheng Fan, Mengjie Song, Fu Xiao, Xue Xue
2019 Energy Procedia  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (967.8 kB)
https://web.archive.org/web/20200307130114/http://ira.lib.polyu.edu.hk/bitstream/10397/80920/1/Fan_Discovering_complex_knowledge.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

., graph generation based on building operational data and knowledge discovery from graph data.  ...  ., graph generation based on building operational data and knowledge discovery from graph data.  ...  Frequent subgraph mining (FSM) is one of the most essential graph mining techniques. It mainly works on undirected graphs with labelled vertices and edges.  ... 
doi:10.1016/j.egypro.2019.01.378 fatcat:a2e4e7eirbddjmu726qzltaxym
Open Access
Citation

Cheng Fan, Mengjie Song, Fu Xiao, Xue Xue. "Discovering Complex Knowledge in Massive Building Operational Data Using Graph Mining for Building Energy Management." Energy Procedia (2019) 2481-2487

« Previous Showing results 1 — 15 out of 63,994 results