CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

An Improved Hybrid Approach of Mining Graphs using Dual Active Feature Sample Selection and LTS (Learn-To-Search)

Published on September 2015 by Maya Aikara, R.r. Sedamkar, Sheetal Rathi
journal_cover_thumbnail

International Conference and Workshop on Communication, Computing and Virtualization
Foundation of Computer Science USA
ICWCCV2015 - Number 2
September 2015
Authors: Maya Aikara, R.r. Sedamkar, Sheetal Rathi
2210ff1b-a69d-4162-9215-d49317051115

Maya Aikara, R.r. Sedamkar, Sheetal Rathi . An Improved Hybrid Approach of Mining Graphs using Dual Active Feature Sample Selection and LTS (Learn-To-Search). International Conference and Workshop on Communication, Computing and Virtualization. ICWCCV2015, 2 (September 2015), 0-0.

@article{
author = { Maya Aikara, R.r. Sedamkar, Sheetal Rathi },
title = { An Improved Hybrid Approach of Mining Graphs using Dual Active Feature Sample Selection and LTS (Learn-To-Search) },
journal = { International Conference and Workshop on Communication, Computing and Virtualization },
issue_date = { September 2015 },
volume = { ICWCCV2015 },
number = { 2 },
month = { September },
year = { 2015 },
issn = 2249-0868,
pages = { 0-0 },
numpages = 1,
url = { /proceedings/icwccv2015/number2/793-1561/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference and Workshop on Communication, Computing and Virtualization
%A Maya Aikara
%A R.r. Sedamkar
%A Sheetal Rathi
%T An Improved Hybrid Approach of Mining Graphs using Dual Active Feature Sample Selection and LTS (Learn-To-Search)
%J International Conference and Workshop on Communication, Computing and Virtualization
%@ 2249-0868
%V ICWCCV2015
%N 2
%P 0-0
%D 2015
%I International Journal of Applied Information Systems
Abstract

In software engineering, discriminative sub graphs are used to identify the bug signatures (context of bug). Most of discriminative sub graph mining algorithms estimate the discriminative sub graphs from a positive and negative labelled graph dataset. The labelling is done manually, which is time as well as cost consuming. A hybrid discriminative sub graph mining algorithm using dual active feature sample selection and LTS, which reduces the manual labelling by 60%. But, this hybrid approach does query graph computation without considering the features of the labelled input graph dataset. Even the precision limit is set to 4, which may not be optimal for all type of input dataset. This paper presents an improved hybrid approach, which does a query graph computation considering all graphs in the input dataset. An additional tool is used for input pre-processing method. The average precision limit is determined so as to achieve maximum recall for any type of input dataset. The experiments and results shows that the improved hybrid approach can achieve an average recall of 66. 67% when the precision limit is set to 3, whereas the earlier hybrid approach attained an average recall of 33. 33% when precision limit was set to 4.

References
  1. Wang, Haixun. Managing and mining graph data. Edited by Charu C. Aggarwal. Vol. 40. New York: Springer, 2010.
  2. Xie, Tao, Suresh Thummalapenta, David Lo, and Chao Liu. "Data mining for software engineering. " Computer 42, no. 8 (2009): 55-62.
  3. Cheng, Hong, David Lo, Yang Zhou, Xiaoyin Wang, and Xifeng Yan. "Identifying bug signatures using discriminative graph mining. " In Proceedings of the eighteenth international symposium on Software testing and analysis, pp. 141-152. ACM, 2009.
  4. Jiang, Chuntao, Frans Coenen, and Michele Zito. "A survey of frequent subgraph mining algorithms. " The Knowledge Engineering Review 28, no. 01 (2013): 75-105.
  5. Eichinger, Frank, Klemens Böhm, and Matthias Huber. "Mining edge-weighted call graphs to localise software bugs. " In Machine Learning and Knowledge Discovery in Databases, pp. 333-348. Springer Berlin Heidelberg, 2008.
  6. Gonzalez, Jesus A. , Lawrence B. Holder, and Diane J. Cook. "Graph-based relational concept learning. " (2002).
  7. Yan, Xifeng, Hong Cheng, Jiawei Han, and Philip S. Yu. "Mining significant graph patterns by leap search. " In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 433-444. ACM,2008.
  8. Thoma, Marisa, Hong Cheng, Arthur Gretton, Jiawei Han, Hans-Peter Kriegel, Alexander J. Smola, Le Song, S. Yu Philip, Xifeng Yan, and Karsten M. Borgwardt. "Near-optimal Supervised Feature Selection among Frequent Subgraphs. " In SDM, pp. 1076-1087. 2009.
  9. Ranu, Sayan, and Ambuj K. Singh. "Graphsig: A scalable approach to mining significant subgraphs in large graph databases. " In Data Engineering, 2009. ICDE'09 IEEE 25th International Conference on,pp. 844-855. IEEE,2009.
  10. Jin, Ning, Calvin Young, and Wei Wang. "Graph classification based on pattern co-occurrence. " In Proceedings of the 18th ACM conference on Information and knowledge management, pp. 573-582. ACM, 2009.
  11. Jin, Ning, Calvin Young, and Wei Wang. "GAIA: graph classification using evolutionary computation. " In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 879-890. ACM, 2010.
  12. Jin, Ning, and Wei Wang. "LTS: Discriminative subgraph mining by learning from search history. " In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pp. 207-218. IEEE, 2011.
  13. Kong, Xiangnan, Wei Fan, and Philip S. Yu. "Dual active feature and sample selection for graph classification. " In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 654-662. ACM, 2011.
  14. Aikara, Maya, R. R. Sedamkar, and Sheetal Rathi. "A Novel Approach using Dual Active Feature Sample Selection and LTS (Learn to Search). "International Journal of Computer Applications 101, no. 13 (2014): 31-36.
  15. Yan, Xifeng, and Jiawei Han. "gSpan: Graph-based substructure pattern mining. " In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, pp. 721-724. IEEE, 2002.
  16. http://eclipsefcg. sourceforge. net/ Tutorial for CFG generator, Eclipse plugin
  17. http://codecover. org/documentation/references/eclManual. html Tutorial for Code Cover tool, Eclipse plugin
  18. http://socnetv. sourceforge. net/docs/manual. html Tutorial for SocNetV (Social Network Visualizer) tool.
Index Terms

Computer Science
Information Sciences

Keywords

Graph Mining Discriminative sub graph mining Bug Signatures