{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:24:26Z","timestamp":1778664266449,"version":"3.51.4"},"reference-count":24,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Experimental &amp; Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2018,11,2]]},"DOI":"10.1080\/0952813x.2018.1467498","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T15:59:36Z","timestamp":1525795176000},"page":"795-809","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["A novel clustering algorithm for attributed graphs based on K-medoid algorithm"],"prefix":"10.1080","volume":"30","author":[{"given":"Saeed","family":"Farzi","sequence":"first","affiliation":[{"name":"Faculty of Computer Engineering, K. N. Toosi University of Technology , Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahar","family":"Kianian","sequence":"additional","affiliation":[{"name":"Faculty of Computer Engineering, Shahid Rajaee Teacher Training University , Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.9"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0074-8"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921638"},{"key":"CIT0004","doi-asserted-by":"crossref","DOI":"10.1145\/1242572.1242635","volume-title":"Extraction and classification of dense communities in the web","author":"Dourisboure Y.","year":"2007"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-010-9158-x"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1038\/nature03288"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.016115"},{"key":"CIT0008","doi-asserted-by":"crossref","DOI":"10.1109\/ICDM.2010.80","volume-title":"Improved consistent sampling, weighted minhash and l1 sketching","author":"Ioffe S.","year":"2010"},{"key":"CIT0009","volume-title":"Clustering by means of medoids","author":"Kaufman L.","year":"1987"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1177\/0165551515592599"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.107"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.06.043"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-014-7170-x"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.37"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"},{"key":"CIT0018","doi-asserted-by":"crossref","DOI":"10.1145\/2488388.2488483","volume-title":"Efficient community detection in large networks using content and links","author":"Ruan Y.","year":"2013"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"CIT0020","doi-asserted-by":"crossref","DOI":"10.1145\/1376616.1376675","volume-title":"Efficient aggregation for graph summarization","author":"Tian Y.","year":"2008"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307740100"},{"key":"CIT0022","doi-asserted-by":"crossref","DOI":"10.1145\/1281192.1281280","volume-title":"Scan: A structural clustering algorithm for networks","author":"Xu X.","year":"2007"},{"key":"CIT0023","volume-title":"A model-based approach to attributed graph clustering","author":"Xu Z.","year":"2012"},{"key":"CIT0024","volume-title":"Clustering large attributed graphs: An efficient incremental approach","author":"Zhou Y.","year":"2010"}],"container-title":["Journal of Experimental &amp; Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/0952813X.2018.1467498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T01:37:46Z","timestamp":1597541866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/0952813X.2018.1467498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,8]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11,2]]}},"alternative-id":["10.1080\/0952813X.2018.1467498"],"URL":"https:\/\/doi.org\/10.1080\/0952813x.2018.1467498","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"value":"0952-813X","type":"print"},{"value":"1362-3079","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,8]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=teta20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=teta20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2017-11-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}