{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:14Z","timestamp":1750221314320,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,31]]},"DOI":"10.1145\/3110025.3110128","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:40:22Z","timestamp":1510670422000},"page":"827-835","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Collective classification in social networks"],"prefix":"10.1145","author":[{"given":"Omar","family":"Jaafor","sequence":"first","affiliation":[{"name":"Charles Delaunay Institute, University of Technology of Troyes, Troyes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babiga","family":"Birregah","sequence":"additional","affiliation":[{"name":"Charles Delaunay Institute, University of Technology of Troyes, Troyes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"93","article-title":"Le design de la visibilit\u00e9: un essai de cartographie du web 2.0","volume":"152","author":"Cardon D.","year":"2008","unstructured":"D. Cardon, \"Le design de la visibilit\u00e9: un essai de cartographie du web 2.0,\" R\u00e9seaux, vol. 152, pp. 93--137, 2008. [Online]. Available: http:\/\/www.cairn.info\/revue-reseaux-2008-6-page-93.htm%5Cnhttp:\/\/www.internetactu.net\/2008\/02\/01\/le-design-de-la-visibilite-un-essai-de-typologie-du-web-20\/","journal-title":"R\u00e9seaux"},{"key":"e_1_3_2_1_2_1","first-page":"148","volume-title":"International Conference on Machine Learning","author":"Freund Y.","year":"1996","unstructured":"Y. Freund and R. R. E. Schapire, \"Experiments with a New Boosting Algorithm,\" International Conference on Machine Learning, pp. 148--156, 1996. [Online]. Available: http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.51.6252"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_4_1","first-page":"318","volume-title":"Learning internal representations by error propagation,\" Parallel distributed processing: explorations in the microstructure of cognition, no. 1","author":"Ruineihart David E.","year":"1985","unstructured":"David E. Ruineihart, Geoffrey E. Hinton and R. J. Williams, \"Learning internal representations by error propagation,\" Parallel distributed processing: explorations in the microstructure of cognition, no. 1, pp. 318--362, 1985."},{"key":"e_1_3_2_1_5_1","first-page":"61","article-title":"Using Maximum Entropy for Text Classification","author":"Nigam K.","year":"1999","unstructured":"K. Nigam, J. Lafferty, and A. Mccallum, \"Using Maximum Entropy for Text Classification,\" IJCAI-99 Workshop on Machine Learning for Information Filtering, pp. 61--67, 1999.","journal-title":"IJCAI-99 Workshop on Machine Learning for Information Filtering"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Probabilistic Inference Using Markov Chain Monte Carlo Methods","volume":"1","author":"Neal R. M.","year":"1998","unstructured":"R. M. Neal, \"Probabilistic Inference Using Markov Chain Monte Carlo Methods,\" Technical Report, vol. 1, pp. 1--144, 1998. [Online]. Available: papers2:\/\/publication\/uuid\/0C88167E-5379-4E4E-A9E4-007ABA4F716D","journal-title":"Technical Report"},{"key":"e_1_3_2_1_7_1","first-page":"93","volume-title":"Collective Classification in Network Data","author":"Sen P.","year":"2008","unstructured":"P. Sen, G. Namata, M. Bilgic, L. Getoor, and B. Gallagher, \"Collective Classification in Network Data,\" pp. 93--106, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277814"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755879"},{"key":"e_1_3_2_1_10_1","first-page":"935","article-title":"Classification in Networked Data: A Toolkit and a Univariate Case Study","volume":"8","author":"Macskassy S. a.","year":"2004","unstructured":"S. a. Macskassy and F. Provost, \"Classification in Networked Data: A Toolkit and a Univariate Case Study,\" Journal of Machine Learning Research, vol. 8, no. December 2004, pp. 935--983, 2007.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0210-x"},{"key":"e_1_3_2_1_12_1","first-page":"256","volume-title":"Using ghost edges for classification in sparsely labeled networks,\" Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08","author":"Gallagher B.","year":"2008","unstructured":"B. Gallagher, H. Tong, T. Eliassi-Rad, and C. Faloutsos, \"Using ghost edges for classification in sparsely labeled networks,\" Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08, p. 256, 2008. [Online]. Available: http:\/\/dl.acm.org\/citation.cfm?doid=1401890.1401925"},{"key":"e_1_3_2_1_13_1","unstructured":"C. Park \"Effective Label Acquisition for Collective Classification Categories and Subject Descriptors \" Design."},{"key":"e_1_3_2_1_14_1","first-page":"307","volume-title":"March","author":"Chakrabarti S.","year":"1998","unstructured":"S. Chakrabarti, B. Dom, and P. Indyk, \"Enhanced hypertext categorization using hyperlinks,\" Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98, no. March, pp. 307--318, 1998. [Online]. Available: http:\/\/portal.acm.org\/citation.cfm?doid=276304.276332"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_5"},{"key":"e_1_3_2_1_17_1","first-page":"593","volume-title":"Why collective inference improves relational classification,\" Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '04","author":"Jensen D.","year":"2004","unstructured":"D. Jensen, J. Neville, and B. Gallagher, \"Why collective inference improves relational classification,\" Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '04, p. 593, 2004. [Online]. Available: http:\/\/portal.acm.org\/citation.cfm?doid=1014052.1014125"},{"key":"e_1_3_2_1_18_1","first-page":"1633","article-title":"Semi-Supervised Learning on Directed Graphs","volume":"17","author":"Zhou D.","year":"2005","unstructured":"D. Zhou, B. Sch\u00f6lkopf, and T. Hofmann, \"Semi-Supervised Learning on Directed Graphs,\" Adv. in Neur. Inf. Proc. Syst. (NIPS), vol. 17, pp. 1633--1640, 2005.","journal-title":"Adv. in Neur. Inf. Proc. Syst. (NIPS)"},{"key":"e_1_3_2_1_19_1","volume-title":"Revisiting Semi-Supervised Learning with Graph Embeddings","author":"Yang Z.","year":"2016","unstructured":"Z. Yang, W. W. Cohen, and R. Salakhutdinov, \"Revisiting Semi-Supervised Learning with Graph Embeddings,\" vol. 48, 2016. [Online]. Available: http:\/\/arxiv.org\/abs\/1603.08861"},{"key":"e_1_3_2_1_20_1","volume-title":"Suspicion scoring of networked entities based on guilt-by-association, collective inference, and focused data access 1,\" no","author":"Macskassy S. A.","year":"2014","unstructured":"S. A. Macskassy and F. Provost, \"Suspicion scoring of networked entities based on guilt-by-association, collective inference, and focused data access 1,\" no. February, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187874"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2011.04.047"},{"key":"e_1_3_2_1_23_1","first-page":"259","article-title":"Linkage and autocorrelation cause feature selection bias in relational learning","author":"Jensen D.","year":"2002","unstructured":"D. Jensen and J. Neville, \"Linkage and autocorrelation cause feature selection bias in relational learning,\" Proceedings of the Nineteenth International Conference on Machine Learning (ICML2002), pp. 259--266, 2002.","journal-title":"Proceedings of the Nineteenth International Conference on Machine Learning (ICML"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"274","article-title":"Avoiding Bias when Aggregating Relational Data with Degree Disparity","volume":"20","author":"Jensen D.","year":"2003","unstructured":"D. Jensen, J. Neville, and M. Hay, \"Avoiding Bias when Aggregating Relational Data with Degree Disparity,\" Proceedings of the Twentieth International Conference on Machine Learning, vol. 20, no. 1, p. 274, 2003.","journal-title":"Proceedings of the Twentieth International Conference on Machine Learning"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2013.08.002"},{"key":"e_1_3_2_1_26_1","unstructured":"L. Wang T. Lou J. Tang and J. E. Hopcroft \"Detecting Community Kernels in Large Social Networks.\""},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"Multi-Stratum Networks: toward a unified model of on-line identities,\" arXiv preprint arXiv:1211.0169","author":"Magnani M.","year":"2012","unstructured":"M. Magnani and L. Rossi, \"Multi-Stratum Networks: toward a unified model of on-line identities,\" arXiv preprint arXiv:1211.0169, pp. 1--18, 2012. [Online]. Available: http:\/\/arxiv.org\/abs\/1211.0169v1"},{"key":"e_1_3_2_1_29_1","first-page":"37","volume-title":"a. Porter, \"Multilayer Networks,\" arXiv","author":"Kivel\u00e4 M.","year":"2014","unstructured":"M. Kivel\u00e4, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. a. Porter, \"Multilayer Networks,\" arXiv, p. 37, 2014. [Online]. Available: http:\/\/arxiv.org\/abs\/1309.7233"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2014.07.001"},{"key":"e_1_3_2_1_31_1","first-page":"1480","volume-title":"France: ACM","author":"Jaafor O.","year":"2015","unstructured":"O. Jaafor, \"Multi-layered graph-based model for social engineering vulnerability assessment,\" in The international conference on Advances in Social Network Analysis and Mining (ASONAM). Paris, France: ACM, 2015, pp. 1480--1488. [Online]. Available: http:\/\/link.springer.com\/bookseries\/8768"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23935-9_37"}],"event":{"name":"ASONAM '17: Advances in Social Networks Analysis and Mining 2017","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Sydney Australia","acronym":"ASONAM '17"},"container-title":["Proceedings of the 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3110128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110025.3110128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:43Z","timestamp":1750212823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3110128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":32,"alternative-id":["10.1145\/3110025.3110128","10.1145\/3110025"],"URL":"https:\/\/doi.org\/10.1145\/3110025.3110128","relation":{},"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"2017-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}