{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:36:32Z","timestamp":1774949792642,"version":"3.50.1"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10994-020-05898-0","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T19:02:58Z","timestamp":1595962978000},"page":"37-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Node classification over bipartite graphs through projection"],"prefix":"10.1007","volume":"110","author":[{"given":"Marija","family":"Stankova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8955-4437","authenticated-orcid":false,"given":"Stiene","family":"Praet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Martens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foster","family":"Provost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"3","key":"5898_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L. A., & Adar, E. (2003). Friends and neighbors on the web. Social Networks, 25(3), 211\u2013230.","journal-title":"Social Networks"},{"key":"5898_CR2","doi-asserted-by":"crossref","unstructured":"Allali, O., Magnien, C., & Latapy, M. (2011). Link prediction in bipartite graphs using internal links and weighted projection. In Conference on computer communications workshops (INFOCOM WKSHPS) (pp. 936\u2013941). IEEE.","DOI":"10.1109\/INFCOMW.2011.5928947"},{"issue":"6","key":"5898_CR3","doi-asserted-by":"crossref","first-page":"066102","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber, M. J. (2007). Modularity and community detection in bipartite networks. Physical Review E, 76(6), 066102.","journal-title":"Physical Review E"},{"key":"5898_CR4","doi-asserted-by":"crossref","unstructured":"Benchettara, N., Kanawati, R., & Rouveirol, C. (2010). Supervised machine learning applied to link prediction in bipartite social networks. In Advances in social networks analysis and mining (ASONAM) (pp. 326\u2013330). IEEE.","DOI":"10.1109\/ASONAM.2010.87"},{"issue":"3","key":"5898_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0378-8733(96)00301-2","volume":"19","author":"SP Borgatti","year":"1997","unstructured":"Borgatti, S. P., & Everett, M. G. (1997). Network analysis of 2-mode data. Social Networks, 19(3), 243\u2013269.","journal-title":"Social Networks"},{"key":"5898_CR6","first-page":"417","volume-title":"The Sage handbook of social network analysis","author":"SP Borgatti","year":"2011","unstructured":"Borgatti, S. P., & Halgin, D. S. (2011). Analyzing affiliation networks. In J. Scott & P. J. Carrington (Eds.), The Sage handbook of social network analysis (pp. 417\u2013433). Thousand Oaks: SAGE Publications."},{"key":"5898_CR7","unstructured":"Brozovsky, L. & Petricek, V. (2007). Recommender system for online dating service. In Proceedings of conference znalosti 2007. Ostrava: VSB."},{"issue":"1482","key":"5898_CR8","doi-asserted-by":"crossref","first-page":"2261","DOI":"10.1098\/rspb.2001.1800","volume":"268","author":"RFI Cancho","year":"2001","unstructured":"Cancho, R. F. I., & Sol\u00e9, R. V. (2001). The small world of human language. Proceedings of the Royal Society of London. Series B: Biological Sciences, 268(1482), 2261\u20132265.","journal-title":"Proceedings of the Royal Society of London. Series B: Biological Sciences"},{"key":"5898_CR9","doi-asserted-by":"crossref","unstructured":"Chen, X., Yu, G., Wang, J., Domeniconi, C., Li, Z., & Zhang, X. (2019). Activehne: Active heterogeneous network embedding. arXiv preprint arXiv:1905.05659.","DOI":"10.24963\/ijcai.2019\/294"},{"key":"5898_CR10","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S. A., & Leskovec, J. (2011). Friendship and mobility: User movement in location-based social networks. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1082\u20131090). ACM.","DOI":"10.1145\/2020408.2020579"},{"key":"5898_CR11","unstructured":"Conitzer, V., Davenport, A., & Kalagnanam, J. (2006). Improved bounds for computing Kemeny rankings. In AAAI (Vol. 6, pp. 620\u2013626)."},{"issue":"5","key":"5898_CR12","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui, P., Wang, X., Pei, J., & Zhu, W. (2018). A survey on network embedding. IEEE Transactions on Knowledge and Data Engineering, 31(5), 833\u2013852.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5898_CR13","unstructured":"de Cnudde, S., Martens, D., Evgeniou, T., & Provost, F. (2017). A benchmarking study of classification techniques for behavioral data. Working papers, University of Antwerp, Faculty of Applied Economics."},{"key":"5898_CR14","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research, 7, 1\u201330.","journal-title":"The Journal of Machine Learning Research"},{"key":"5898_CR15","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chawla, N. V., & Swami, A. (2017). metapath2vec: Scalable representation learning for heterogeneous networks. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 135\u2013144). ACM.","DOI":"10.1145\/3097983.3098036"},{"issue":"1","key":"5898_CR16","doi-asserted-by":"crossref","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. (2004). Generalized blockmodeling of two-mode network data. Social Networks, 26(1), 29\u201353.","journal-title":"Social Networks"},{"key":"5898_CR17","doi-asserted-by":"crossref","unstructured":"Du, W., Yu, S., Yang, M., Qu, Q., & Zhu, J. (2018). GPSP: Graph partition and space projection based approach for heterogeneous network embedding. In Companion proceedings of the the web conference (Vol. 2018, pp. 59\u201360).","DOI":"10.1145\/3184558.3186928"},{"issue":"4","key":"5898_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle, N., & Pentland, A. (2006). Reality mining: Sensing complex social systems. Personal and Ubiquitous Computing, 10(4), 255\u2013268.","journal-title":"Personal and Ubiquitous Computing"},{"key":"5898_CR19","first-page":"1871","volume":"9","author":"R-E Fan","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., & Lin, C.-J. (2008). LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9, 1871\u20131874.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"5898_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0378-8733(96)00300-0","volume":"19","author":"K Faust","year":"1997","unstructured":"Faust, K. (1997). Centrality in affiliation networks. Social Networks, 19(2), 157\u2013191.","journal-title":"Social Networks"},{"issue":"8","key":"5898_CR21","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T. (2006). An introduction to ROC analysis. Pattern Recognition Letters, 27(8), 861\u2013874.","journal-title":"Pattern Recognition Letters"},{"key":"5898_CR22","volume-title":"Statistical distributions","author":"C Forbes","year":"2011","unstructured":"Forbes, C., Evans, M., Hastings, N., & Peacock, B. (2011). Statistical distributions. New York: Wiley."},{"key":"5898_CR23","doi-asserted-by":"crossref","unstructured":"Gallagher, B., Tong, H., Eliassi-Rad, T., & Faloutsos, C. (2008). Using ghost edges for classification in sparsely labeled networks. In Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 256\u2013264). ACM.","DOI":"10.1145\/1401890.1401925"},{"key":"5898_CR24","doi-asserted-by":"crossref","unstructured":"Gao, M., Chen, L., He, X., & Zhou, A. (2018). Bine: Bipartite network embedding. In The 41st international ACM SIGIR conference on research and development in information retrieval (pp. 715\u2013724). ACM.","DOI":"10.1145\/3209978.3209987"},{"key":"5898_CR25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor, L., & Taskar, B. (2007). Introduction to statistical relational learning (Vol. 1). Cambridge: MIT Press."},{"key":"5898_CR26","unstructured":"Goel, S., Hofman, J. M., & Sirer, M. I. (2012). Who does what on the web: A large-scale study of browsing behavior. In ICWSM."},{"key":"5898_CR27","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., & Ferrara, E. (2018). Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems, 151, 78\u201394.","journal-title":"Knowledge-Based Systems"},{"key":"5898_CR28","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/249487","volume":"23","author":"S Gregor","year":"1999","unstructured":"Gregor, S., & Benbasat, I. (1999). Explanations from intelligent systems: Theoretical foundations and implications for practice. MIS Quarterly, 23(4), 497\u2013530.","journal-title":"MIS Quarterly"},{"key":"5898_CR29","doi-asserted-by":"crossref","unstructured":"Grover, A. & Leskovec, J. (2016). node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 855\u2013864). ACM.","DOI":"10.1145\/2939672.2939754"},{"issue":"2","key":"5898_CR30","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"J-L Guillaume","year":"2006","unstructured":"Guillaume, J.-L., & Latapy, M. (2006). Bipartite graphs as models of complex networks. Physica A: Statistical Mechanics and its Applications, 371(2), 795\u2013813.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"5898_CR31","doi-asserted-by":"crossref","unstructured":"Gupte, M. & Eliassi-Rad, T. (2012). Measuring tie strength in implicit social networks. In Proceedings of the 3rd annual ACM web science conference (pp. 109\u2013118). ACM.","DOI":"10.1145\/2380718.2380734"},{"key":"5898_CR32","doi-asserted-by":"crossref","unstructured":"Hu, J., Zeng, H.-J., Li, H., Niu, C., & Chen, Z. (2007). Demographic prediction based on user\u2019s browsing behavior. In Proceedings of the 16th international conference on world wide web (pp. 151\u2013160). ACM.","DOI":"10.1145\/1242572.1242594"},{"key":"5898_CR33","unstructured":"Huang, H. S., Lin, K. L., & Hsu C.-N., & Hsu, J. Y. J. (2005). Item-triggered recommendation for identifying potential customers of cold sellers in supermarkets. In Workshop on the next stage of recommender systems research, in conjunction with the 2005 international conference on intelligent user interfaces (IUI 2005)."},{"key":"5898_CR34","doi-asserted-by":"crossref","unstructured":"Huang, X., Song, Q., Yang, F., & Hu, X. (2019). Large-scale heterogeneous feature embedding. In Proceedings of the AAAI conference on artificial intelligence (Vol. 33, pp. 3878\u20133885).","DOI":"10.1609\/aaai.v33i01.33013878"},{"key":"5898_CR35","doi-asserted-by":"crossref","unstructured":"Huang, Z., Li, X., & Chen, H. (2005). Link prediction approach to collaborative filtering. In Proceedings of the 5th ACM\/IEEE-CS joint conference on digital libraries (pp. 141\u2013142). ACM.","DOI":"10.1145\/1065385.1065415"},{"key":"5898_CR36","unstructured":"Jensen, D. & Neville, J. (2002). Linkage and autocorrelation cause feature selection bias in relational learning. In Proceedings of the nineteenth international conference on machine learning, ICML \u201902 (pp. 259\u2013266). San Francisco, CA, USA: Morgan Kaufmann Publishers Inc."},{"key":"5898_CR37","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1108\/eb026526","volume":"28","author":"KS Jones","year":"1972","unstructured":"Jones, K. S. (1972). A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28, 11\u201321.","journal-title":"Journal of Documentation"},{"issue":"4","key":"5898_CR38","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1089\/big.2013.0037","volume":"1","author":"E Junqu\u00e9 de Fortuny","year":"2013","unstructured":"Junqu\u00e9 de Fortuny, E., Martens, D., & Provost, F. (2013). Predictive modeling with big data: Is bigger really better? Big Data, 1(4), 215\u2013226.","journal-title":"Big Data"},{"key":"5898_CR39","doi-asserted-by":"crossref","unstructured":"Khosravi, H. & Bina, B. (2010). A survey on statistical relational learning. In Canadian conference on artificial intelligence (pp. 256\u2013268). Springer.","DOI":"10.1007\/978-3-642-13059-5_25"},{"key":"5898_CR40","unstructured":"Kim, J. H. (2017). Hypotheses generation using link prediction in a bipartite graph. CoRR arXiv:abs\/1708.04725."},{"key":"5898_CR41","unstructured":"Kipf, T. N. & Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907."},{"issue":"15","key":"5898_CR42","doi-asserted-by":"crossref","first-page":"5802","DOI":"10.1073\/pnas.1218772110","volume":"110","author":"M Kosinski","year":"2013","unstructured":"Kosinski, M., Stillwell, D., & Graepel, T. (2013). Private traits and attributes are predictable from digital records of human behavior. Proceedings of the National Academy of Sciences, 110(15), 5802\u20135805.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"5898_CR43","doi-asserted-by":"crossref","first-page":"066107","DOI":"10.1103\/PhysRevE.72.066107","volume":"72","author":"R Lambiotte","year":"2005","unstructured":"Lambiotte, R., & Ausloos, M. (2005). Uncovering collective listening habits and music genres in bipartite networks. Physical Review E, 72(6), 066107.","journal-title":"Physical Review E"},{"key":"5898_CR44","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy, M., Magnien, C., & Vecchio, N. D. (2008). Basic notations for the analysis of large two-mode networks. Social Networks, 30, 31\u201348.","journal-title":"Social Networks"},{"issue":"7","key":"5898_CR45","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., & Kleinberg, J. (2007). The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7), 1019\u20131031.","journal-title":"Journal of the American Society for Information Science and Technology"},{"issue":"5","key":"5898_CR46","doi-asserted-by":"crossref","first-page":"056127","DOI":"10.1103\/PhysRevE.72.056127","volume":"72","author":"PG Lind","year":"2005","unstructured":"Lind, P. G., Gonzalez, M. C., & Herrmann, H. J. (2005). Cycles and clustering in bipartite networks. Physical Review E, 72(5), 056127.","journal-title":"Physical Review E"},{"key":"5898_CR47","doi-asserted-by":"crossref","unstructured":"Liu, N., Huang, X., Li, J., & Hu, X. (2018). On interpretation of network embedding via taxonomy induction. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201918 (pp. 1812\u20131820). New York, NY, USA: ACM.","DOI":"10.1145\/3219819.3220001"},{"key":"5898_CR48","unstructured":"Li, X., Wang, H., Gu, B., & Ling, C. X. (2015). Data sparseness in linear SVM. IJCAI (pp. 3628\u20133634)."},{"key":"5898_CR49","unstructured":"Lu, Q., & Getoor, L. (2003). Link-based classification. In ICML (Vol. 3, pp. 496\u2013503)."},{"key":"5898_CR50","doi-asserted-by":"crossref","DOI":"10.21236\/ADA452802","volume-title":"A simple relational classifier","author":"SA Macskassy","year":"2003","unstructured":"Macskassy, S. A., & Provost, F. (2003). A simple relational classifier. New York: NYU Stern School of Business."},{"key":"5898_CR51","first-page":"935","volume":"8","author":"SA Macskassy","year":"2007","unstructured":"Macskassy, S. A., & Provost, F. (2007). Classification in networked data: A toolkit and a univariate case study. Journal of Machine Learning Research, 8, 935\u2013983.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"5898_CR52","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1016\/j.ejor.2006.04.051","volume":"183","author":"D Martens","year":"2007","unstructured":"Martens, D., Baesens, B., Van Gestel, T., & Vanthienen, J. (2007). Comprehensible credit scoring models using rule extraction from support vector machines. European Journal of Operational Research, 183(3), 1466\u20131476.","journal-title":"European Journal of Operational Research"},{"key":"5898_CR53","unstructured":"Martens, D. & Provost, F. (2011). Pseudo-social network targeting from consumer transaction data. Working paper CeDER-11-05, New York University\u2014Stern School of Business."},{"issue":"1","key":"5898_CR54","doi-asserted-by":"crossref","first-page":"73","DOI":"10.25300\/MISQ\/2014\/38.1.04","volume":"38","author":"D Martens","year":"2014","unstructured":"Martens, D., & Provost, F. (2014). Explaining data-driven document classifications. MIS Quarterly, 38(1), 73\u2013100.","journal-title":"MIS Quarterly"},{"key":"5898_CR55","unstructured":"Martens, D., Provost, F., Clark, J., & de Fortuny, E. J. (2013). Mining fine-grained consumer payment data to improve targeted marketing. Working paper, New York University\u2014Stern School of Business."},{"issue":"4","key":"5898_CR56","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1016\/j.dss.2011.01.013","volume":"51","author":"D Martens","year":"2011","unstructured":"Martens, D., Vanthienen, J., Verbeke, W., & Baesens, B. (2011). Performance of classification models from a user perspective. Decision Support Systems, 51(4), 782\u2013793.","journal-title":"Decision Support Systems"},{"issue":"1","key":"5898_CR57","first-page":"16","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman, M. E. (2001a). Scientific collaboration networks. I. Network construction and fundamental results. Physical Review E, 64(1), 16\u2013131.","journal-title":"Physical Review E"},{"issue":"1","key":"5898_CR58","first-page":"16","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman, M. E. (2001b). Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E, 64(1), 16\u2013132.","journal-title":"Physical Review E"},{"issue":"2","key":"5898_CR59","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2011","unstructured":"Opsahl, T. (2011). Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Social Networks, 35(2), 159\u2013167.","journal-title":"Social Networks"},{"key":"5898_CR60","doi-asserted-by":"crossref","unstructured":"Perlich, C. & Provost, F. (2003). Aggregation-based feature invention and relational concept classes. In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 167\u2013176). ACM.","DOI":"10.1145\/956750.956772"},{"issue":"1\u20132","key":"5898_CR61","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10994-006-6064-1","volume":"62","author":"C Perlich","year":"2006","unstructured":"Perlich, C., & Provost, F. (2006). Distribution-based aggregation for relational learning with identifier attributes. Machine Learning, 62(1\u20132), 65\u2013105.","journal-title":"Machine Learning"},{"issue":"2","key":"5898_CR62","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1964897.1964901","volume":"12","author":"C Perlich","year":"2011","unstructured":"Perlich, C., & \u015awirszcz, G. (2011). On cross-validation and stacking: Building seemingly predictive models on random data. ACM SIGKDD Explorations Newsletter, 12(2), 11\u201315.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"5898_CR63","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., & Skiena, S. (2014). Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 701\u2013710). ACM.","DOI":"10.1145\/2623330.2623732"},{"key":"5898_CR64","doi-asserted-by":"crossref","unstructured":"Provost, F., Dalessandro, B., Hook, R., Zhang, X., & Murray, A. (2009). Audience selection for on-line brand advertising: Privacy-friendly social network targeting. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 707\u2013716). ACM.","DOI":"10.1145\/1557019.1557098"},{"key":"5898_CR65","volume-title":"Data science for business: What you need to know about data mining and data-analytic thinking","author":"F Provost","year":"2013","unstructured":"Provost, F., & Fawcett, T. (2013). Data science for business: What you need to know about data mining and data-analytic thinking. Newton: O\u2019Reilly Media Inc."},{"issue":"2","key":"5898_CR66","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009876119989","volume":"3","author":"F Provost","year":"1999","unstructured":"Provost, F., & Kolluri, V. (1999). A survey of methods for scaling up inductive algorithms. Data Mining and Knowledge Discovery, 3(2), 131\u2013169.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5898_CR67","unstructured":"Provost, F., Martens, D., & Murray, A. (2012). Geo-social network advertising. In 2012 winter conference on business intelligence."},{"issue":"2","key":"5898_CR68","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/isre.2015.0576","volume":"26","author":"F Provost","year":"2015","unstructured":"Provost, F., Martens, D., & Murray, A. (2015). Finding mobile consumers with a privacy-friendly geo-similarity network. Information Systems Research, 26(2), 243\u2013265.","journal-title":"Information Systems Research"},{"key":"5898_CR69","doi-asserted-by":"crossref","unstructured":"Raeder, T., Stitelman, O., Dalessandro, B., Perlich, C., & Provost, F. (2012). Design principles of massive, robust prediction systems. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1357\u20131365). ACM.","DOI":"10.1145\/2339530.2339740"},{"issue":"1","key":"5898_CR70","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins, G., & Alexander, M. (2004). Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Computational & Mathematical Organization Theory, 10(1), 69\u201394.","journal-title":"Computational & Mathematical Organization Theory"},{"key":"5898_CR71","unstructured":"Rrnyi, A. (1961). On measures of entropy and information. In Fourth Berkeley symposium on mathematical statistics and probability (pp. 547\u2013561)."},{"issue":"1","key":"5898_CR72","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.scaman.2010.10.002","volume":"27","author":"C Seierstad","year":"2011","unstructured":"Seierstad, C., & Opsahl, T. (2011). For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in norway. Scandinavian Journal of Management, 27(1), 44\u201354.","journal-title":"Scandinavian Journal of Management"},{"key":"5898_CR73","unstructured":"Sun, J., Qu, H., Chakrabarti, D., & Faloutsos, C. (2005). Neighborhood formation and anomaly detection in bipartite graphs. In Proceedings of the fifth IEEE international conference on data mining, ICDM \u201905 (pp. 418\u2013425). Washington, DC, USA: IEEE Computer Society."},{"key":"5898_CR74","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015). Line: Large-scale information network embedding. In Proceedings of the 24th international conference on world wide web (pp. 1067\u20131077). International World Wide Web Conferences Steering Committee.","DOI":"10.1145\/2736277.2741093"},{"key":"5898_CR75","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., & Zhu, W. (2016). Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 1225\u20131234). ACM.","DOI":"10.1145\/2939672.2939753"},{"key":"5898_CR76","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., & Guo, M. (2018). Graphgan: Graph representation learning with generative adversarial nets. In Thirty-second AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v32i1.11872"},{"key":"5898_CR77","doi-asserted-by":"crossref","unstructured":"Weber, I., Garimella, V. R. K., & Borra, E. (2013). Inferring audience partisanship for youtube videos. In Proceedings of the 22nd international conference on world wide web companion (pp. 43\u201344). International World Wide Web Conferences Steering Committee.","DOI":"10.1145\/2487788.2487803"},{"issue":"2","key":"5898_CR78","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"HP Young","year":"1978","unstructured":"Young, H. P., & Levenglick, A. (1978). A consistent extension of Condorcet\u2019s election principle. SIAM Journal on Applied Mathematics, 35(2), 285\u2013300.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"5898_CR79","unstructured":"Yu, H.-F., Lo, H.-Y., Hsieh, H.-P., Lou, J.-K., McKenzie, T. G., Chou, J.-W., Chung, P.-H., Ho, C.-H., Chang, C.-F., Wei, Y.-H., et al. (2010). Feature engineering and classifier ensemble for KDD cup 2010. In Proceedings of the KDD cup 2010 workshop (pp. 1\u201316)."},{"key":"5898_CR80","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C., Simon, H., & Gu, M. (2001). Bipartite graph partitioning and data clustering. In Proceedings of the tenth international conference on information and knowledge management (pp. 25\u201332). ACM.","DOI":"10.2172\/816202"},{"key":"5898_CR81","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TBDATA.2018.2850013","volume":"6","author":"D Zhang","year":"2018","unstructured":"Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2018). Network representation learning: A survey. IEEE Transactions on Big Data, 6(1), 3\u201328.","journal-title":"IEEE Transactions on Big Data"},{"key":"5898_CR82","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Xiong, Y., Kong, X., & Zhu, Y. (2017). Learning node embeddings in interaction graphs. In Proceedings of the 2017 ACM on conference on information and knowledge management (pp. 397\u2013406).","DOI":"10.1145\/3132847.3132918"},{"issue":"4","key":"5898_CR83","doi-asserted-by":"crossref","first-page":"046115","DOI":"10.1103\/PhysRevE.76.046115","volume":"76","author":"T Zhou","year":"2007","unstructured":"Zhou, T., Ren, J., Medo, M., & Zhang, Y.-C. (2007). Bipartite network projection and personal recommendation. Physical Review E, 76(4), 046115.","journal-title":"Physical Review E"},{"key":"5898_CR84","doi-asserted-by":"crossref","unstructured":"Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G. (2005). Improving recommendation lists through topic diversification. In Proceedings of the 14th international conference on world wide web (pp. 22\u201332). ACM.","DOI":"10.1145\/1060745.1060754"},{"issue":"3","key":"5898_CR85","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13278-011-0021-0","volume":"1","author":"KA Zweig","year":"2011","unstructured":"Zweig, K. A., & Kaufmann, M. (2011). A systematic approach to the one-mode projection of bipartite graphs. Social Network Analysis and Mining, 1(3), 187\u2013218.","journal-title":"Social Network Analysis and Mining"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-020-05898-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T22:23:36Z","timestamp":1667600616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-020-05898-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,28]]},"references-count":85,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["5898"],"URL":"https:\/\/doi.org\/10.1007\/s10994-020-05898-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,28]]},"assertion":[{"value":"15 July 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}