{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:34:30Z","timestamp":1742996070608,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319573502"},{"type":"electronic","value":"9783319573519"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57351-9_9","type":"book-chapter","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T11:08:53Z","timestamp":1491822533000},"page":"71-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reflexive Regular Equivalence for Bipartite Data"],"prefix":"10.1007","author":[{"given":"Aaron","family":"Gerow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stan","family":"Matwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,11]]},"reference":[{"key":"9_CR1","unstructured":"Borgatti, S.P.: 2-mode concepts in social network analysis. In: Encyclopedia of Complexity and System Science, vol. 6 (2009)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/2576011","volume":"53","author":"RL Breiger","year":"1974","unstructured":"Breiger, R.L.: The duality of persons and groups. Soc. Forces 53, 181\u2013190 (1974)","journal-title":"Soc. Forces"},{"key":"9_CR3","unstructured":"Codocedo, V., Napoli, A.: Lattice-based biclustering using partition pattern structures. In: ECAI 2014, pp. 213\u2013218 (2014)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the SIGKDD 2001, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.socnet.2004.01.002","volume":"26","author":"P Doreian","year":"2004","unstructured":"Doreian, P., Batagelj, V., Ferligoj, A.: Generalized blockmodeling of two-mode network data. Soc. Netw. 26(1), 29\u201353 (2004)","journal-title":"Soc. Netw."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-27433-1_15","volume-title":"Social Informatics","author":"A Gerow","year":"2015","unstructured":"Gerow, A., Lou, B., Duede, E., Evans, J.: Proposing ties in a dense hypergraph of academics. Social Informatics. LNCS, vol. 9471, pp. 209\u2013226. Springer, Cham (2015). doi:\n                      10.1007\/978-3-319-27433-1_15"},{"key":"9_CR7","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-33281-4_13","volume-title":"Perspectives in Business Informatics Research","author":"D Gnatyshak","year":"2012","unstructured":"Gnatyshak, D., Ignatov, D.I., Semenov, A., Poelmans, J.: Gaining insight in social networks with biclustering and triclustering. In: Aseeva, N., Babkin, E., Kozyrev, O. (eds.) BIR 2012. LNBIP, vol. 128, pp. 162\u2013171. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-33281-4_13"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10618-012-0292-8","volume":"28","author":"RG Pensa","year":"2014","unstructured":"Pensa, R.G., Ienco, D., Meo, R.: Hierarchical co-clustering: off-line and incremental approaches. Data Min. Knowl. Disc. 28(1), 31\u201364 (2014)","journal-title":"Data Min. Knowl. Disc."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.socnet.2015.02.006","volume":"43","author":"F Shi","year":"2015","unstructured":"Shi, F., Foster, J.G., Evans, J.A.: Weaving the fabric of science: dynamic network models of science\u2019s unfolding structure. Soc. Netw. 43, 73\u201385 (2015)","journal-title":"Soc. Netw."},{"issue":"1\u201320","key":"9_CR11","first-page":"122","volume":"9","author":"A Tanay","year":"2005","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. Handb. Comput. Mol. Biol. 9(1\u201320), 122\u2013124 (2005)","journal-title":"Handb. Comput. Mol. Biol."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1186\/1471-2164-13-301","volume":"13","author":"L Teng","year":"2012","unstructured":"Teng, L., Tan, K.: Finding combinatorial histone code by semi-supervised biclustering. BMC Genom. 13(1), 301 (2012)","journal-title":"BMC Genom."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57351-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:05:26Z","timestamp":1558317926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57351-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319573502","9783319573519"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57351-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Canadian AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canadian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"canadianai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aigicrv.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}