Skip to main content
Top

2017 | OriginalPaper | Chapter

Solving the Subgraph Isomorphism Problem Using Harmony Search

Authors : Hoyeong Yun, Yongjoon Joe, Byung-Ok Jung, Hyoguen Bang, Dongmyung Shin

Published in: Advanced Multimedia and Ubiquitous Engineering

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The active usage of open source software contributes many areas. However, there are many problems like ignoring license or intellectual properties infringement which can lead litigation. In this paper, we try to find original open source software by using similarity of source code. Source code similarity analyze resembles plagiarism detection problem, and using program dependence graph can be handled as a subgraph isomorphism problem which is one of NP-complete. In this paper, we apply harmony search, one of a metaheuristic algorithm, to solve the problem efficiently.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Ji, J.H., Woo, G., Cho, H.G.: A plagiarism detection technique for Java program using Bytecode analysis. J. Korean Inst. Inf. Sci. Eng. 35(7), 442–451 (2008) Ji, J.H., Woo, G., Cho, H.G.: A plagiarism detection technique for Java program using Bytecode analysis. J. Korean Inst. Inf. Sci. Eng. 35(7), 442–451 (2008)
2.
go back to reference Kim, Y.C., Hwang, S.C., Choi, J.Y.: A program similarity evaluation algorithm. J. Korean Soc. Inf. 6(1), 51–64 (2005) Kim, Y.C., Hwang, S.C., Choi, J.Y.: A program similarity evaluation algorithm. J. Korean Soc. Inf. 6(1), 51–64 (2005)
3.
go back to reference Kim, S.H.: Plagiarism detection using dependence graph analysis specialized for Javascript. Master Thesis, Korea Advanced Institute of Science Technology (2011) Kim, S.H.: Plagiarism detection using dependence graph analysis specialized for Javascript. Master Thesis, Korea Advanced Institute of Science Technology (2011)
4.
go back to reference Koschke, R., Falke, R., Frenzel, P.: Clone detection using abstract syntax suffix trees. In: Proceedings of the 13th Working Conference on Reverse Engineering, pp. 253–262. IEEE (2006) Koschke, R., Falke, R., Frenzel, P.: Clone detection using abstract syntax suffix trees. In: Proceedings of the 13th Working Conference on Reverse Engineering, pp. 253–262. IEEE (2006)
5.
go back to reference Liu, C., Chen, C., Han, J., Yu, P.S.: GPLAG: detection of Software plagiarism by program dependence graph analysis. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 872–881 (2006) Liu, C., Chen, C., Han, J., Yu, P.S.: GPLAG: detection of Software plagiarism by program dependence graph analysis. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 872–881 (2006)
6.
go back to reference Kim, Y.E., Cheon, J.S., Byun, S.W., Woo, G.: A parallel performance comparison of Haskell using a plagiarism detection method. In: Korea Computer Congress, pp. 1724–1726 (2016) Kim, Y.E., Cheon, J.S., Byun, S.W., Woo, G.: A parallel performance comparison of Haskell using a plagiarism detection method. In: Korea Computer Congress, pp. 1724–1726 (2016)
7.
go back to reference Prechelt, L., Malpohl, G., Philippsen, M.: Finding plagiarism among a set of programs with JPlag. J. Univ. Comput. Sci. 8(11), 1016–1038 (2002) Prechelt, L., Malpohl, G., Philippsen, M.: Finding plagiarism among a set of programs with JPlag. J. Univ. Comput. Sci. 8(11), 1016–1038 (2002)
8.
go back to reference Gitchell, D., Tran, N.: Sim: a utility for detecting similarity in computer programs. ACM SIGCSE Bull. 31(1), 266–270 (1999). ACMCrossRef Gitchell, D., Tran, N.: Sim: a utility for detecting similarity in computer programs. ACM SIGCSE Bull. 31(1), 266–270 (1999). ACMCrossRef
9.
go back to reference Wise, M.J.: YAP3: improved detection of similarities in computer program and other texts. ACM SIGCSE Bull. 28(1), 130–134 (1996)CrossRef Wise, M.J.: YAP3: improved detection of similarities in computer program and other texts. ACM SIGCSE Bull. 28(1), 130–134 (1996)CrossRef
10.
go back to reference Suresh Singh, G.: Graph Theory. PHI Learning, New Delhi (2010)MATH Suresh Singh, G.: Graph Theory. PHI Learning, New Delhi (2010)MATH
11.
go back to reference Choi, J.E., Yoon, Y.R., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 361–368 (2012) Choi, J.E., Yoon, Y.R., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 361–368 (2012)
12.
go back to reference Farahani, M.M., Chaharsoughi, S.K.: A genetic and iterative local search algorithm for solving subgraph isomorphism problem. In: International Conference on Industrial Engineering and Operations Management (IEOM), pp. 1–6. IEEE (2015) Farahani, M.M., Chaharsoughi, S.K.: A genetic and iterative local search algorithm for solving subgraph isomorphism problem. In: International Conference on Industrial Engineering and Operations Management (IEOM), pp. 1–6. IEEE (2015)
13.
go back to reference Li, Z., Chen, B., Che, D.: Solving the subgraph isomorphism problem using simulated annealing and evolutionary algorithms. In: Proceedings on the International Conference on Artificial Intelligence (ICAI). The Steering Committee of the World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), pp. 293–299 (2016) Li, Z., Chen, B., Che, D.: Solving the subgraph isomorphism problem using simulated annealing and evolutionary algorithms. In: Proceedings on the International Conference on Artificial Intelligence (ICAI). The Steering Committee of the World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), pp. 293–299 (2016)
14.
go back to reference Choi, J., Yoon, Y., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (2012) Choi, J., Yoon, Y., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (2012)
Metadata
Title
Solving the Subgraph Isomorphism Problem Using Harmony Search
Authors
Hoyeong Yun
Yongjoon Joe
Byung-Ok Jung
Hyoguen Bang
Dongmyung Shin
Copyright Year
2017
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-5041-1_27

Premium Partner