Skip to main content

2012 | OriginalPaper | Buchkapitel

9. Software Similarity Searching and Classification

verfasst von : Silvio Cesare, Yang Xiang

Erschienen in: Software Similarity and Classification

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The ultimate problem of this book is to search for similar software to our query from a database and to classify a program as belonging to a particular class. This chapter examines how we transform the pair-wise similarity problem into a similarity search problem over a database. Moreover, we examine statistical classification of birthmarks to identify the class of software it belongs to.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat Baeza-Yates R, Navarro G (1998) Fast approximate string matching in a dictionary. In: South American symposium on string processing and information retrieval (SPIR’98), pp 14–22 Baeza-Yates R, Navarro G (1998) Fast approximate string matching in a dictionary. In: South American symposium on string processing and information retrieval (SPIR’98), pp 14–22
2.
Zurück zum Zitat Peter NY (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms, Austin, Texas, United States. Society for Industrial and Applied Mathematics, pp 311–321 Peter NY (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms, Austin, Texas, United States. Society for Industrial and Applied Mathematics, pp 311–321
3.
Zurück zum Zitat Paolo C, Marco P, Pavel Z (1997) M-Tree: an efficient access method for similarity search in metric spaces. Paper presented at the proceedings of the 23rd international conference on very large data bases Paolo C, Marco P, Pavel Z (1997) M-Tree: an efficient access method for similarity search in metric spaces. Paper presented at the proceedings of the 23rd international conference on very large data bases
4.
Zurück zum Zitat Caetano Traina Jr, Agma JMT, Bernhard S, Christos F (2000) Slim-trees: high performance metric trees minimizing overlap between nodes. Paper presented at the proceedings of the 7th international conference on extending database technology: advances in database technology Caetano Traina Jr, Agma JMT, Bernhard S, Christos F (2000) Slim-trees: high performance metric trees minimizing overlap between nodes. Paper presented at the proceedings of the 7th international conference on extending database technology: advances in database technology
5.
Zurück zum Zitat Vieira MR, Chino FJT, Traina C, Jr, Traina AJM (2004) DBM-Tree: a dynamic metric access method sensitive to local density data. In: Brazilian symposium on databases, Brazil pp 163–177 Vieira MR, Chino FJT, Traina C, Jr, Traina AJM (2004) DBM-Tree: a dynamic metric access method sensitive to local density data. In: Brazilian symposium on databases, Brazil pp 163–177
6.
Zurück zum Zitat Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: ACM pp 604–613 Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: ACM pp 604–613
7.
Zurück zum Zitat F-Secure (2007) F-Secure reports amount of malware grew by 100% during 2007 F-Secure (2007) F-Secure reports amount of malware grew by 100% during 2007
8.
Zurück zum Zitat Novak D, Zezula P (2006) M-Chord: a scalable distributed similarity search structure. Paper presented at the proceedings of the 1st international conference on scalable information systems, Hong Kong Novak D, Zezula P (2006) M-Chord: a scalable distributed similarity search structure. Paper presented at the proceedings of the 1st international conference on scalable information systems, Hong Kong
9.
Zurück zum Zitat Batko M, Gennaro C, Savino P, Zezula P (2004) Scalable similarity search in metric spaces. In: 213–224 Batko M, Gennaro C, Savino P, Zezula P (2004) Scalable similarity search in metric spaces. In: 213–224
10.
Zurück zum Zitat Batko M, Gennaro C, Zezula P (2005) A scalable nearest neighbor search in p2p systems. Databases, information systems, and peer-to-peer computing, pp 79–92 Batko M, Gennaro C, Zezula P (2005) A scalable nearest neighbor search in p2p systems. Databases, information systems, and peer-to-peer computing, pp 79–92
11.
Zurück zum Zitat Haghani P, Michel S, Aberer K (2009) Distributed similarity search in high dimensions using locality sensitive hashing. Paper presented at the proceedings of the 12th international conference on extending database technology: advances in database technology, Saint Petersburg, Russia Haghani P, Michel S, Aberer K (2009) Distributed similarity search in high dimensions using locality sensitive hashing. Paper presented at the proceedings of the 12th international conference on extending database technology: advances in database technology, Saint Petersburg, Russia
12.
Zurück zum Zitat Cortes C, Vapnik V (1995) Support-vector networks. Mach learn 20(3):273–297MATH Cortes C, Vapnik V (1995) Support-vector networks. Mach learn 20(3):273–297MATH
Metadaten
Titel
Software Similarity Searching and Classification
verfasst von
Silvio Cesare
Yang Xiang
Copyright-Jahr
2012
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-2909-7_9