Graphical Data Mining

Author:

Romanowski Carol J.1

Affiliation:

1. Rochester Institute of Technology, USA

Abstract

Data mining has grown to include many more data types than the “traditional” flat files with numeric or categorical attributes. Images, text, video, and the internet are now areas of burgeoning data mining research. Graphical data is also an area of interest, since data in many domains—such as engineering design, network intrusion detection, fraud detection, criminology, document analysis, pharmacology, and biochemistry—can be represented in this form. Graph mining algorithms and methods are fewer and less mature than those designed for numerical or categorical data. In addition, the distinction between graph matching and graph mining is not always clear. In graph mining, we often want to find all possible frequent subgraphs of all possible sizes that occur a specified minimum number of times. That goal involves iteratively matching incrementally larger subgraphs, while classical graph matching is a single search for a static subgraph. Also, graph mining is an unsupervised learning task. Instead of searching for a single match to a specific graph, we are looking for known or unknown graphs embedded in the data.

Publisher

IGI Global

Reference49 articles.

1. Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules. In Proceedings of the 20th International Conference on Very Large Databases, (pp. 487-499). San Mateo, California: Morgan Kaufmann Publishers, Inc.

2. Borgelt, C., & Berthold, M. R. (2002). Mining molecular fragments: finding relevant substructures of molecules. In Proceedings of the IEEE International Conference on Data Mining, (pp. 51-58). Piscataway, NJ: IEEE.

3. Graph mining

4. Chakravarthy, S., Beera, R., & Balachandran, R. (2004) DB-Subdue: Database approach to graph mining. In H. Dai, R. Srikant, and C. Zhang, editors, Advances in Knowledge Discovery and Data Mining, Proceedings of the 8th PAKDD Conference, (pp. 341-350). New York: Springer.

5. Chen, J., Sun, L., Zaïane, O., & Goebel, R. (2004). Visualizing & Discovering Web Navigational Patterns. In Proceedings of the 7th International Workshop on the Web & Databases, (pp. 13-18). New York: ACM Press.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3