{"id":"https://openalex.org/W2800300350","doi":"https://doi.org/10.1080/0952813x.2018.1467498","title":"A novel clustering algorithm for attributed graphs based on K-medoid algorithm","display_name":"A novel clustering algorithm for attributed graphs based on K-medoid algorithm","publication_year":2018,"publication_date":"2018-05-08","ids":{"openalex":"https://openalex.org/W2800300350","doi":"https://doi.org/10.1080/0952813x.2018.1467498","mag":"2800300350"},"language":"en","primary_location":{"id":"doi:10.1080/0952813x.2018.1467498","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2018.1467498","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012248611","display_name":"Saeed Farzi","orcid":"https://orcid.org/0000-0003-2850-0616"},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Saeed Farzi","raw_affiliation_strings":["Faculty of Computer Engineering, K. N. Toosi University of Technology , Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Engineering, K. N. Toosi University of Technology , Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047175258","display_name":"Sahar Kianian","orcid":"https://orcid.org/0000-0001-9367-7456"},"institutions":[{"id":"https://openalex.org/I83123760","display_name":"Shahid Rajaee Teacher Training University","ror":"https://ror.org/02nkz4493","country_code":"IR","type":"education","lineage":["https://openalex.org/I83123760"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Sahar Kianian","raw_affiliation_strings":["Faculty of Computer Engineering, Shahid Rajaee Teacher Training University , Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Engineering, Shahid Rajaee Teacher Training University , Tehran, Iran","institution_ids":["https://openalex.org/I83123760"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012248611"],"corresponding_institution_ids":["https://openalex.org/I80543232"],"apc_list":null,"apc_paid":null,"fwci":0.7404,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.69835495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":"6","first_page":"795","last_page":"809"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13976","display_name":"Web visibility and informetrics","score":0.9800999760627747,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/jaccard-index","display_name":"Jaccard index","score":0.9169156551361084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8425019979476929},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7343391180038452},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6793465614318848},{"id":"https://openalex.org/keywords/medoid","display_name":"Medoid","score":0.5588369965553284},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5381830930709839},{"id":"https://openalex.org/keywords/usability","display_name":"Usability","score":0.5044342279434204},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49512162804603577},{"id":"https://openalex.org/keywords/rand-index","display_name":"Rand index","score":0.4623715877532959},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.30168986320495605},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22663331031799316}],"concepts":[{"id":"https://openalex.org/C203519979","wikidata":"https://www.wikidata.org/wiki/Q865360","display_name":"Jaccard index","level":3,"score":0.9169156551361084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8425019979476929},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7343391180038452},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6793465614318848},{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.5588369965553284},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5381830930709839},{"id":"https://openalex.org/C170130773","wikidata":"https://www.wikidata.org/wiki/Q216378","display_name":"Usability","level":2,"score":0.5044342279434204},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49512162804603577},{"id":"https://openalex.org/C111442797","wikidata":"https://www.wikidata.org/wiki/Q7291446","display_name":"Rand index","level":3,"score":0.4623715877532959},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30168986320495605},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22663331031799316},{"id":"https://openalex.org/C107457646","wikidata":"https://www.wikidata.org/wiki/Q207434","display_name":"Human\u2013computer interaction","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0952813x.2018.1467498","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2018.1467498","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W87092222","https://openalex.org/W791318738","https://openalex.org/W1465386037","https://openalex.org/W1969170759","https://openalex.org/W1993591232","https://openalex.org/W2017987256","https://openalex.org/W2018045523","https://openalex.org/W2043696802","https://openalex.org/W2075109048","https://openalex.org/W2095246902","https://openalex.org/W2095293504","https://openalex.org/W2096631127","https://openalex.org/W2099495349","https://openalex.org/W2111315907","https://openalex.org/W2121947440","https://openalex.org/W2124536061","https://openalex.org/W2125580539","https://openalex.org/W2126907894","https://openalex.org/W2134008243","https://openalex.org/W2135827982","https://openalex.org/W2137962371","https://openalex.org/W2148606196","https://openalex.org/W2169206507","https://openalex.org/W2591321299"],"related_works":["https://openalex.org/W4231826642","https://openalex.org/W2090634555","https://openalex.org/W2758138366","https://openalex.org/W1989967017","https://openalex.org/W2114506251","https://openalex.org/W2100425112","https://openalex.org/W1989549761","https://openalex.org/W2083620785","https://openalex.org/W2112801327","https://openalex.org/W3037673319"],"abstract_inverted_index":{"Articulateness":[0],"and":[1,31,48,53,66,75],"plasticity":[2],"are":[3,58,69],"two":[4],"essential":[5],"attributes":[6],"that":[7],"make":[8],"a":[9,36],"graph":[10,22],"as":[11],"an":[12],"efficient":[13],"model":[14],"to":[15,73],"real":[16,61],"life":[17,62],"problems.":[18],"Nowadays,":[19],"the":[20,54,77,87,90],"attributed":[21],"is":[23],"received":[24],"lots":[25],"of":[26,29,89,95],"attentions":[27],"because":[28],"usability":[30],"effectiveness.":[32],"In":[33],"this":[34],"study,":[35],"novel":[37],"k-Medoid":[38],"based":[39],"clustering":[40,82],"algorithm,":[41],"which":[42],"focuses":[43],"simultaneously":[44],"on":[45],"both":[46],"structural":[47],"contextual":[49],"aspects":[50],"using":[51],"Signal":[52],"weighted":[55],"Jaccard":[56],"similarities,":[57],"introduced.":[59],"Two":[60],"data-sets,":[63],"Political":[64],"Blogs":[65],"DBLP":[67],"bibliography,":[68],"employed":[70],"in":[71,93],"order":[72],"evaluate":[74],"compare":[76],"proposed":[78,91],"algorithm":[79,92],"with":[80],"state-of-the-art":[81],"algorithms.":[83],"The":[84],"results":[85],"show":[86],"superiorities":[88],"terms":[94],"cluster":[96],"quality":[97],"metrics.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}