{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:39Z","timestamp":1740099159127,"version":"3.37.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030017675"},{"type":"electronic","value":"9783030017682"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01768-2_22","type":"book-chapter","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T16:48:08Z","timestamp":1538671688000},"page":"264-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Communication-Free Widened Learning of Bayesian Network Classifiers Using Hashed Fiedler Vectors"],"prefix":"10.1007","author":[{"given":"Oliver R.","family":"Sampson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Borgelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-34156-4_4","volume-title":"Advances in Intelligent Data Analysis XI","author":"Zaenal Akbar","year":"2012","unstructured":"Akbar, Zaenal, Ivanova, Violeta N., Berthold, Michael R.: Parallel data mining revisited. Better, not faster. In: Hollm\u00e9n, Jaakko, Klawonn, Frank, Tucker, Allan (eds.) IDA 2012. LNCS, vol. 7619, pp. 23\u201334. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34156-4_4"},{"key":"22_CR2","unstructured":"Akl, S.G.: Parallel real-time computation: sometimes quantity means quality. In: Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks, 2000. I-SPAN 2000, pp. 2\u201311. IEEE (2000)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2576868","volume":"47","author":"Concha Bielza","year":"2014","unstructured":"Bielza, Concha, Larra\u00f1aga, Pedro: Discrete Bayesian network classifiers: a survey. ACM Comput. Surv. (CSUR) 47(1), 5 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"22_CR4","unstructured":"Andrei Z. Broder. On the resemblance and containment of documents. In: Proceedings of Compression and Complexity of Sequences 1997, pp. 21\u201329. IEEE (1997)"},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/bioinformatics\/17.5.419","volume":"17","author":"Jeremy Buhler","year":"2001","unstructured":"Buhler, Jeremy: Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17(5), 419\u2013428 (2001)","journal-title":"Bioinformatics"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388. ACM (2002)","DOI":"10.1145\/509907.509965"},{"key":"22_CR7","unstructured":"Fan-Roon Kim Chung. Spectral Graph Theory. Number 92 in Regional Conference Series in Mathematics. American Mathematical Society, 1997"},{"key":"22_CR8","unstructured":"Coenen, F.: LUCS-KDD DN software (2003)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262. ACM (2004)","DOI":"10.1145\/997817.997857"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Doyle, P.G., Laurie Snell, J.: Random Walks and Electric Networks. Mathematical Association of America (1984)","DOI":"10.5948\/UPO9781614440222"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-24465-5_8","volume-title":"Advances in Intelligent Data Analysis XIV","author":"Alexander Fillbrunn","year":"2015","unstructured":"Fillbrunn, Alexander, Berthold, Michael R.: Diversity-driven widening of hierarchical agglomerative clustering. In: Fromont, Elisa, De Bie, Tijl, van Leeuwen, Matthijs (eds.) IDA 2015. LNCS, vol. 9385, pp. 84\u201394. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24465-5_8"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-68765-0_8","volume-title":"Advances in Intelligent Data Analysis XVI","author":"Alexander Fillbrunn","year":"2017","unstructured":"Fillbrunn, Alexander, W\u00f6rteler, Leonard, Grossniklaus, Michael, Berthold, Michael R.: Bucket selection: a model-independent diverse selection strategy for widening. In: Adams, Niall, Tucker, Allan, Weston, David (eds.) IDA 2017. LNCS, vol. 10584, pp. 87\u201398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68765-0_8"},{"key":"22_CR13","first-page":"518","volume":"99","author":"Aristides Gionis","year":"1999","unstructured":"Gionis, Aristides, Indyk, Piotr, Motwani, Rajeev: Similarity search in high dimensions via hashing. VLDB 99, 518\u2013529 (1999)","journal-title":"VLDB"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.22057","volume":"85","author":"Krystal Guo","year":"2017","unstructured":"Guo, Krystal, Mohar, Bojan: Hermitian adjacency matrix of digraphs and mixed graphs. J. Graph Theory 85(1), 217\u2013248 (2017)","journal-title":"J. Graph Theory"},{"issue":"1","key":"22_CR15","first-page":"53","volume":"40","author":"TJT Koski","year":"2012","unstructured":"Koski, T.J.T., Noble, J.M.: A review of Bayesian networks and structure learning. Mathematica Applicanda 40(1), 53\u2013103 (2012)","journal-title":"Mathematica Applicanda"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: 12th International Conference on Computer Vision, pp. 2130\u20137. IEEE (2009)","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ins.2012.12.051","volume":"233","author":"Pedro Larra\u00f1aga","year":"2013","unstructured":"Larra\u00f1aga, Pedro, Karshenas, Hossein, Bielza, Concha, Santana, Roberto: A review on evolutionary algorithms in Bayesian network learning and inference tasks. Inf. Sci. 233, 109\u2013125 (2013)","journal-title":"Inf. Sci."},{"key":"22_CR18","unstructured":"Lichman, M.: UCI Machine Learning Repository (2013)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-70659-3_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"Bin Luo","year":"2002","unstructured":"Luo, Bin, Wilson, Richard C., Hancock, Edwin R.: Spectral feature vectors for graph clustering. In: Caelli, Terry, Amin, Adnan, Duin, Robert P.W., de Ridder, Dick, Kamel, Mohamed (eds.) SSPR \/SPR 2002. LNCS, vol. 2396, pp. 83\u201393. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-70659-3_8"},{"issue":"8","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/TMM.2008.2007293","volume":"10","author":"Matija Marolt","year":"2008","unstructured":"Marolt, Matija: A mid-level representation for melody-based retrieval in audio collections. IEEE Trans. Multimed. 10(8), 1617\u20131625 (2008)","journal-title":"IEEE Trans. Multimed."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Meinl, T.: Maximum-Score Diversity Selection. Ph.D. thesis, University of Konstanz, Konstanz, Germany (2010)","DOI":"10.1186\/1758-2946-2-S1-P33"},{"key":"22_CR22","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., Burlington (1988)"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patcog.2005.06.014","volume":"39","author":"Huaijun Qiu","year":"2006","unstructured":"Qiu, Huaijun, Hancock, Edwin R.: Graph matching and clustering using spectral partitions. Pattern Recognit. 39(1), 22\u201334 (2006)","journal-title":"Pattern Recognit."},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-12571-8_24","volume-title":"Advances in Intelligent Data Analysis XIII","author":"Oliver Sampson","year":"2014","unstructured":"Sampson, Oliver, Berthold, Michael R.: Widened KRIMP: better performance through diverse parallelism. In: Blockeel, Hendrik, van Leeuwen, Matthijs, Vinciotti, Veronica (eds.) IDA 2014. LNCS, vol. 8819, pp. 276\u2013285. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12571-8_24"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-46349-0_19","volume-title":"Advances in Intelligent Data Analysis XV","author":"Oliver R Sampson","year":"2016","unstructured":"Sampson, Oliver R., Berthold, Michael R.: Widened learning of Bayesian network classifiers. In: Bostr\u00f6m, Henrik, Knobbe, Arno, Soares, Carlos, Papapetrou, Panagiotis (eds.) IDA 2016. LNCS, vol. 9897, pp. 215\u2013225. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46349-0_19"},{"issue":"1","key":"22_CR26","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"Satu Elisa Schaeffer","year":"2007","unstructured":"Satu Elisa Schaeffer: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"22_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v035.i03","volume":"35","author":"Marco Scutari","year":"2010","unstructured":"Scutari, Marco: Learning Bayesian networks with the bnlearn R package. J. Stat. Softw. 35(3), 1\u201322 (2010)","journal-title":"J. Stat. Softw."},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-73951-7_4","volume-title":"Algorithms and Data Structures","author":"Kengo Terasawa","year":"2007","unstructured":"Terasawa, Kengo, Tanaka, Yuzuru: Spherical LSH for approximate nearest neighbor search on unit hypersphere. In: Dehne, Frank, Sack, J\u00f6rg-R\u00fcdiger, Zeh, Norbert (eds.) WADS 2007. LNCS, vol. 4619, pp. 27\u201338. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73951-7_4"},{"key":"22_CR29","unstructured":"Van Dam, E.R., Haemers, W.H.: Which graphs are determined by their spectrum? Linear Algebra Appl. 373, 241\u2013272 (2003)"},{"issue":"01","key":"22_CR30","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0219633602000117","volume":"01","author":"SARASWATHI VISHVESHWARA","year":"2002","unstructured":"Vishveshwara, S., Brinda, K.V., Kannan, N.: Protein structure: insights from graph theory. J. Theor. Comput. Chem. 1(01), 187\u2013211 (2002)","journal-title":"Journal of Theoretical and Computational Chemistry"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-24075-6_60","volume-title":"Advances in Multimedia Information Processing \u2013 PCM 2015","author":"Boyu Zhang","year":"2015","unstructured":"Zhang, Boyu, Liu, Xianglong, Lang, Bo: Fast graph similarity search via locality sensitive hashing. In: Ho, Yo-Sung, Sang, Jitao, Ro, Yong Man, Kim, Junmo, Wu, Fei (eds.) PCM 2015. LNCS, vol. 9314, pp. 623\u2013633. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24075-6_60"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XVII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01768-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T08:54:32Z","timestamp":1662195272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01768-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017675","9783030017682"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01768-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"\u2018s-Hertogenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2018.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}