The week's pick
Reseach Article
Taxonomic Superimposed Tree and Graph Mining Algorithms: A Comprehensive Study
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 174 - Number 7 |
| Year of Publication: 2017 |
| Authors: Saed Khawaldeh, Usama Pervaiz, Yeman B. Hagos, Tajwar A. Aleef, Vu Hoang Minh |
10.5120/ijca2017915430
|
Saed Khawaldeh, Usama Pervaiz, Yeman B. Hagos, Tajwar A. Aleef, Vu Hoang Minh . Taxonomic Superimposed Tree and Graph Mining Algorithms: A Comprehensive Study. International Journal of Computer Applications. 174, 7 ( Sep 2017), 29-36. DOI=10.5120/ijca2017915430
Abstract
Data mining is one of the most popular research topics nowadays. It has a lot of applications in many fields such as bioinformatics, social networks, XML processing, web usage mining and computer networks. To the best of our knowledge, taxonomic subtree mining in tree dataset and taxonomic subgraph mining in single graph dataset are problems which have not been studied before. On the contrary, taxonomic subgraph mining for graph transaction dataset has been discussed and presented in many papers in the literature. In general, subtree and subgraph mining algorithms are divided into two types: apprior-based approach algorithms and pattern-growth approach algorithms. Moreover, each frequent subtree and subgraph mining algorithm should include two steps; candidate generation and support counting. Our goal in this paper is to present a summary about the available tree and graph mining algorithms which have been discussed in the literature, also, to propose a taxonomic superimposed tree and graph mining algorithms inspired by the taxonomy-superimposed graph mining concepts. The proposals that we present in this paper can be used for mining biological tree and graph datasets to find frequent subtree and subgraph patterns.
References
- Fernando, S. G. S., and S. N. Perera. Empirical Analysis of Data Mining Techniques for Social Network Websites. Compusoft 3.2 (2014): 582.
- Rehman, Saif Ur, Asmat Ullah Khan, and Simon Fong. Graph mining: A survey of graph mining techniques. Digital Information Management (ICDIM), 2012 Seventh International Conference on. IEEE, 2012.
- Kuramochi, Michihiro, and George Karypis. ”Finding frequent patterns in a large sparse graph*.” Data mining and knowledge discovery 11.3 (2005): 243-271.
- Chehreghani, Mostafa Haghir, and Maurice Bruynooghe. ”Mining rooted ordered trees under subtree homeomorphism.” Data Mining and Knowl-edge Discovery (2015): 1-24.
- Huan, Jun, Wei Wang, and Jan Prins. ”Efficient mining of frequent subgraphs in the presence of isomorphism.” Data Mining, 2003. ICDM 2003. Third IEEE International Conference on. IEEE, 2003.
- Yan, Xifeng, and Jiawei Han. ”gspan: Graph-based substructure pattern mining.” Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on. IEEE, 2002.
- Kuramochi, Michihiro, and George Karypis. ”Frequent subgraph discov-ery.” Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on. IEEE, 2001.
- Cakmak, Ali, and Gultekin Ozsoyoglu. ”Mining biological networks for unknown pathways.” Bioinformatics 23.20 (2007): 2775-2783.
- Cakmak, Ali, and Gultekin Ozsoyoglu. ”Taxonomy-superimposed graph mining.” Proceedings of the 11th international conference on Extending database technology: Advances in database technology. ACM, 2008.
- Chen, Tzung-Shi, and Shih-Chun Hsu. ”Mining frequent tree-like pat-terns in large datasets.” Data and Knowledge Engineering 62.1 (2007): 65-83.
- Zaki, Mohammed J.”Efficiently mining frequent embedded unordered trees.” Fundamenta Informaticae 66.1-2 (2005): 33-52.
- Bei, Yijun, et al.”Mining Sequential Trees in a Tree Sequence Database.”International Journal of Database Theory and Application 7.3 (2014): 107-120.
- Chehreghani, Mostafa Haghir, et al.”OInduced: An efficient algorithm for mining induced patterns from rooted ordered trees.” Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on 41.5 (2011): 1013-1025.
- Liu, Wei, and Ling Chen. ”An Efficient Way of Frequent Embedded Subtree Mining on Biological Data.” Journal of Computers 6.12 (2011): 2574-2581.
- Bifet, Albert, and Ricard Gavald. ”Mining adaptively frequent closed unlabeled rooted trees in data streams.” Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2008.
- Omer, Barkol, Bergman Ruth, and Golan Shahar. ”A New Frequent Similar Tree Algorithm Motivated by DOM Mining Using RTDM and its new variantSiSTeR.” (2012).
- Tatikonda, Shirish, Srinivasan Parthasarathy, and Tahsin Kurc. ”TRIPS and TIDES: new algorithms for tree mining.” Proceedings of the 15th ACM international conference on Information and Knowledge Management.
Index Terms
Keywords