{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:39:04Z","timestamp":1784288344781,"version":"3.55.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/tcss.2021.3085406","type":"journal-article","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:54:05Z","timestamp":1623354845000},"page":"1369-1378","source":"Crossref","is-referenced-by-count":38,"title":["Identifying Groups of Fake Reviewers Using a Semisupervised Approach"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4835-4556","authenticated-orcid":false,"given":"Punit","family":"Rathore","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jayesh","family":"Soni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nagarajan","family":"Prabakar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3635-4252","authenticated-orcid":false,"given":"Marimuthu","family":"Palaniswami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8942-8702","authenticated-orcid":false,"given":"Paolo","family":"Santi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313660"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.31"},{"key":"ref32","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783370"},{"key":"ref37","first-page":"9180","article-title":"Watch your step: Learning node embeddings via graph attention","author":"abu-el-haija","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2842191"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.02.011"},{"key":"ref10","first-page":"175","article-title":"Exploiting burstiness in reviews for review spammer detection","volume":"13","author":"fei","year":"2013","journal-title":"Proc ICWSM"},{"key":"ref40","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref11","first-page":"29","article-title":"Opinion fraud detection in online reviews by network effects","volume":"13","author":"akoglu","year":"2013","journal-title":"Proc ICWSM"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.12.029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-015-0029-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187863"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505700"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37401-2_21"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.20"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23528-8_17"},{"key":"ref19","first-page":"3","article-title":"Effective machine learning approach to detect groups of fake reviewers","author":"soni","year":"2018","journal-title":"Proc 14th Int Conf Data Sci (ICDATA)"},{"key":"ref28","first-page":"409","article-title":"What yelp fake review filter might be doing?","author":"mukherjee","year":"2013","journal-title":"Proc ICWSM"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242759"},{"key":"ref27","first-page":"27","article-title":"Semi-supervised clustering by seeding","author":"basu","year":"2002","journal-title":"Proc 19th Int'l Conf Machine Learning (ICML)"},{"key":"ref3","author":"saleh","year":"2015","journal-title":"The Importance of Online Customer Reviews [Infographic]"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871557"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963240"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341560"},{"key":"ref8","article-title":"Finding deceptive opinion spam by any stretch of the imagination","author":"ott","year":"2011","journal-title":"arXiv 1107 4557"},{"key":"ref7","first-page":"1","article-title":"Learning to identify review spam","author":"li","year":"2011","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref2","author":"kats","year":"2020","journal-title":"How are Consumers Spending Some Their Time? Reading Reviews Lots of Reviews"},{"key":"ref9","first-page":"105","article-title":"Distributional footprints of deceptive product reviews","volume":"12","author":"feng","year":"2012","journal-title":"Proc ICWSM"},{"key":"ref1","author":"kaemingk","year":"2019","journal-title":"20 Online Review Stats to Know in 2019"},{"key":"ref46","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv068"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICWR.2019.8765274"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3316585"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/35"},{"key":"ref42","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","volume":"1","author":"wagstaff","year":"2001","journal-title":"Proc ICML"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20810-7_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"ref23","first-page":"1","article-title":"Feature extraction through deepwalk on weighted graph","author":"soni","year":"2019","journal-title":"Proc 15th Int Conf Data Sci (ICDATA)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1270"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-019-09664-w"},{"key":"ref43","article-title":"ConiVAT: Cluster tendency assessment and clustering with partial background knowledge","author":"rathore","year":"2020","journal-title":"arXiv 2008 09570"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2655032"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/9632444\/09451179.pdf?arnumber=9451179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:50Z","timestamp":1652194430000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9451179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":48,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2021.3085406","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}