{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:00:22Z","timestamp":1772906422659,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030367077","type":"print"},{"value":"9783030367084","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36708-4_63","type":"book-chapter","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T10:24:22Z","timestamp":1576146262000},"page":"766-778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering"],"prefix":"10.1007","author":[{"given":"Tianxiang","family":"He","sequence":"first","affiliation":[]},{"given":"Chansu","family":"Han","sequence":"additional","affiliation":[]},{"given":"Ryoichi","family":"Isawa","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[]},{"given":"Jun\u2019ichi","family":"Takeuchi","sequence":"additional","affiliation":[]},{"given":"Koji","family":"Nakao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"63_CR1","unstructured":"Malwr. \nhttps:\/\/malwr.com\/"},{"key":"63_CR2","unstructured":"Virustotal. \nhttps:\/\/www.virustotal.com\/"},{"key":"63_CR3","unstructured":"Antonakakis, M., et al.: Understanding the Mirai botnet. In: Proceedings of the 26th USENIX Conference on Security Symposium, SEC 2017, pp. 1093\u20131110. USENIX Association, Berkeley (2017)"},{"key":"63_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-74320-0_10","volume-title":"Recent Advances in Intrusion Detection","author":"M Bailey","year":"2007","unstructured":"Bailey, M., Oberheide, J., Andersen, J., Mao, Z.M., Jahanian, F., Nazario, J.: Automated classification and analysis of internet malware. In: Kruegel, C., Lippmann, R., Clark, A. (eds.) RAID 2007. LNCS, vol. 4637, pp. 178\u2013197. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74320-0_10"},{"key":"63_CR5","unstructured":"Bayer, U., Comparetti, P.M., Hlauschek, C., Kr\u00fcgel, C., Kirda, E.: Scalable, behavior-based malware clustering. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2009, San Diego, pp. 8\u201311 (2009)"},{"key":"63_CR6","unstructured":"Black Lotus Labs: Attack of things! \nhttps:\/\/www.netformation.com\/our-pov\/attack-of-things-2\/"},{"issue":"5","key":"63_CR7","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1109\/TIT.2007.894669","volume":"53","author":"M Cebrian","year":"2007","unstructured":"Cebrian, M., Alfonseca, M., Ortega, A.: The normalized compression distance is resistant to noise. IEEE Trans. Inf. Theory 53(5), 1895\u20131900 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"63_CR8","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vitanyi, P.M.B.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"63_CR9","unstructured":"Doctor Web: Dr.Web. \nhttps:\/\/www.drweb.com"},{"key":"63_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/11523468_102","volume-title":"Automata, Languages and Programming","author":"I Elias","year":"2005","unstructured":"Elias, I., Lagergren, J.: Fast neighbor joining. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1263\u20131274. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11523468_102"},{"issue":"1\u20132","key":"63_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s11416-005-0002-9","volume":"1","author":"ME Karim","year":"2005","unstructured":"Karim, M.E., Walenstein, A., Lakhotia, A., Parida, L.: Malware phylogeny generation using permutations of code. J. Comput. Virol. 1(1\u20132), 13\u201323 (2005)","journal-title":"J. Comput. Virol."},{"issue":"5","key":"63_CR12","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/bioinformatics\/btm563","volume":"24","author":"P Langfelder","year":"2007","unstructured":"Langfelder, P., Zhang, B., Horvath, S.: Defining clusters from a hierarchical cluster tree: the dynamic tree cut package for R. Bioinformatics 24(5), 719\u2013720 (2007)","journal-title":"Bioinformatics"},{"issue":"12","key":"63_CR13","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.M.B.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"63_CR14","unstructured":"Pa, Y.M.P., Suzuki, S., Yoshioka, K., Matsumoto, T., Kasama, T., Rossow, C.: IoTPOT: analysing the rise of IoT compromises. In: 9th USENIX Workshop on Offensive Technologies, WOOT 2015. USENIX Association, Washington, D.C. (2015)"},{"issue":"3","key":"63_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0009490","volume":"5","author":"MN Price","year":"2010","unstructured":"Price, M.N., Dehal, P.S., Arkin, A.P.: Fasttree 2 - approximately maximum-likelihood trees for large alignments. PLOS ONE 5(3), 1\u201310 (2010)","journal-title":"PLOS ONE"},{"issue":"4","key":"63_CR16","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"63_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-603-2","volume-title":"Data Compression - The Complete Reference","author":"D Salomon","year":"2007","unstructured":"Salomon, D.: Data Compression - The Complete Reference, 4th edn. Springer, London (2007). \nhttps:\/\/doi.org\/10.1007\/978-1-84628-603-2","edition":"4"},{"key":"63_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-87361-7_10","volume-title":"Algorithms in Bioinformatics","author":"M Simonsen","year":"2008","unstructured":"Simonsen, M., Mailund, T., Pedersen, C.N.S.: Rapid neighbour-joining. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 113\u2013122. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87361-7_10"},{"key":"63_CR19","unstructured":"Yone, T.: Phylogenetic tree estimation for large-scale malware datasets. Master\u2019s thesis. Kyushu University, Japan (2016). (in Japanese)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36708-4_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T10:54:08Z","timestamp":1576148048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36708-4_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030367077","9783030367084"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36708-4_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ajiips.com.au\/iconip2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}