CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Novel Approach using Dual Active Feature Sample Selection and LTS (Learn to Search)

by Maya Aikara, R.r. Sedamkar, Sheetal Rathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 101 - Number 13
Year of Publication: 2014
Authors: Maya Aikara, R.r. Sedamkar, Sheetal Rathi
10.5120/17750-8833

Maya Aikara, R.r. Sedamkar, Sheetal Rathi . A Novel Approach using Dual Active Feature Sample Selection and LTS (Learn to Search). International Journal of Computer Applications. 101, 13 ( September 2014), 31-36. DOI=10.5120/17750-8833

@article{ 10.5120/17750-8833,
author = { Maya Aikara, R.r. Sedamkar, Sheetal Rathi },
title = { A Novel Approach using Dual Active Feature Sample Selection and LTS (Learn to Search) },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 101 },
number = { 13 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume101/number13/17750-8833/ },
doi = { 10.5120/17750-8833 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:31:36.491578+05:30
%A Maya Aikara
%A R.r. Sedamkar
%A Sheetal Rathi
%T A Novel Approach using Dual Active Feature Sample Selection and LTS (Learn to Search)
%J International Journal of Computer Applications
%@ 0975-8887
%V 101
%N 13
%P 31-36
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Determining the bug signatures(context of bug) is difficult, as it involves mining the execution traces of the program. The discriminative graph mining algorithm is used to identify the bug signatures. It requires manual labelling of the input set to estimate the discriminative subgraphs. To reduce the tedious work of manual labelling, this paper presents novel framework to identify bug signatures. The proposed algorithm uses hybrid approach of dual active feature sample selection and LTS(Learn to Search). In the hybrid method, the dual active feature sample selection is used to find the query graph and its corresponding discriminative subgraphs, and LTS method is applied to obtain risk free optimal solution. The performance of the combined approach is measured with the parameters (i)runtime, (ii)recall and (iii)precision. The experiment results shows that this hybrid approach has an improved runtime of 60. 10% when only 40% of the input graph set is manually labelled. The recall and precision are also improved by 33. 33% when compared with dual active feature sample selection without LTS.

References
  1. Xie, T. , Thummalapenta, S. , Lo, D. , & Liu, C. (2009). Data mining for software engineering. Computer, 42(8), 55-62.
  2. Cook, Diane J. , and Lawrence B. Holder, eds. Mining graph data. John Wiley & Sons, 2006.
  3. Jiang, Chuntao, Frans Coenen, and Michele Zito. "A survey of frequent subgraph mining algorithms. " The Knowledge Engineering Review 28, no. 01 (2013): 75-105.
  4. 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.
  5. Lo, David, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, and Chengnian Sun. "Classification of software behaviors for failure detection: a discriminative pattern mining approach. " In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 557-566. ACM, 2009.
  6. 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.
  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. 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.
  9. 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.
  10. 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.
  11. Menzies, Tim, Jeremy Greenwald, and Art Frank. "Data mining static code attributes to learn defect predictors. " Software Engineering, IEEE Transactions on 33, no. 1 (2007): 2-13.
  12. http://eclipsefcg. sourceforge. net/ Tutorial for CFG generator, Eclipse plugin
  13. http://codecover. org/documentation/references/eclMan -ual. html Tutorial for Code Cover tool, Eclipse plugin
Index Terms

Computer Science
Information Sciences

Keywords

Graph Mining Discriminative subgraph mining Bug Signatures

Powered by PhDFocusTM