{"id":"https://openalex.org/W2088142987","doi":"https://doi.org/10.1109/bibe.2012.6399734","title":"A new iterative graph based clustering method","display_name":"A new iterative graph based clustering method","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2088142987","doi":"https://doi.org/10.1109/bibe.2012.6399734","mag":"2088142987"},"language":"en","primary_location":{"id":"doi:10.1109/bibe.2012.6399734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2012.6399734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 12th International Conference on Bioinformatics &amp; Bioengineering (BIBE)","raw_type":"proceedings-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/A5059960217","display_name":"Erion\u2010Vasilis Pikoulis","orcid":"https://orcid.org/0000-0002-2337-5142"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Erion-Vasilis Pikoulis","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Rio-Patras, Greece","Department of Computer Engineering & Informatics, University of Patras, 26500, Rio-Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Rio-Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Engineering & Informatics, University of Patras, 26500, Rio-Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054394462","display_name":"Emmanouil \u0396. Psarakis","orcid":"https://orcid.org/0000-0002-9627-0640"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Emmanouil Z. Psarakis","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Rio-Patras, Greece","Department of Computer Engineering & Informatics, University of Patras, 26500, Rio-Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Rio-Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Engineering & Informatics, University of Patras, 26500, Rio-Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059960217"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10296796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":null,"first_page":"566","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8777719736099243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6908133625984192},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6747249960899353},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.6387943625450134},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6206699013710022},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.560971736907959},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5179940462112427},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.4943530559539795},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.4918379783630371},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.47119829058647156},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.46092721819877625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4483543336391449},{"id":"https://openalex.org/keywords/determining-the-number-of-clusters-in-a-data-set","display_name":"Determining the number of clusters in a data set","score":0.44468510150909424},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.4378497898578644},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4285498261451721},{"id":"https://openalex.org/keywords/clustering-high-dimensional-data","display_name":"Clustering high-dimensional data","score":0.42549216747283936},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.33155858516693115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32976073026657104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.261688232421875},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17073124647140503}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8777719736099243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6908133625984192},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6747249960899353},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.6387943625450134},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6206699013710022},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.560971736907959},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5179940462112427},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4943530559539795},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.4918379783630371},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.47119829058647156},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.46092721819877625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4483543336391449},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.44468510150909424},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4378497898578644},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4285498261451721},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.42549216747283936},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.33155858516693115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32976073026657104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.261688232421875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17073124647140503},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bibe.2012.6399734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2012.6399734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 12th International Conference on Bioinformatics &amp; Bioengineering (BIBE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1991408655","https://openalex.org/W1993757086","https://openalex.org/W2058720919","https://openalex.org/W2095293504","https://openalex.org/W2110734043","https://openalex.org/W2121564430","https://openalex.org/W2121947440","https://openalex.org/W2127048411","https://openalex.org/W2127218421","https://openalex.org/W2132914434","https://openalex.org/W2135957668","https://openalex.org/W2152219892","https://openalex.org/W2155754954","https://openalex.org/W2161455936","https://openalex.org/W2612166593","https://openalex.org/W3102641634","https://openalex.org/W4244055225","https://openalex.org/W6678914141"],"related_works":["https://openalex.org/W2160785859","https://openalex.org/W2188840951","https://openalex.org/W2770741777","https://openalex.org/W2141140100","https://openalex.org/W2559422900","https://openalex.org/W2590117803","https://openalex.org/W3186815950","https://openalex.org/W2202413591","https://openalex.org/W2389934482","https://openalex.org/W2040929534"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,38,49,125],"new":[6],"iterative":[7,30],"graph":[8],"based":[9,129],"clustering":[10,24,53,86,89,102],"technique.":[11],"The":[12,111],"proposed":[13,112],"method":[14,113],"has":[15],"three":[16],"desirable":[17],"characteristics":[18,142],"as":[19,51,87],"compared":[20],"to":[21,46],"well":[22,117],"known":[23,48,118],"techniques.":[25],"Specifically,":[26],"because":[27],"of":[28,34,60,63,73,101,127],"its":[29],"nature,":[31],"the":[32,61,64,71,74,85,98],"number":[33,126],"clusters":[35],"contained":[36],"in":[37,58,97],"given":[39],"data":[40,136],"set":[41],"it":[42],"is":[43,81,109,114],"not":[44,68],"necessary":[45],"be":[47],"priori":[50],"partitional":[52],"techniques":[54,90],"demand.":[55,91],"Its":[56],"performance,":[57],"terms":[59],"quality":[62],"achieved":[65],"clustering,":[66],"does":[67],"depend":[69],"on":[70,130],"distribution":[72],"cluster's":[75],"size.":[76],"Finally,":[77],"no":[78],"threshold":[79],"value":[80],"required":[82],"for":[83],"achieving":[84],"hierarchical":[88],"All":[92],"these":[93],"features":[94],"manifest":[95],"themselves":[96],"important":[99],"problem":[100],"homologous":[103],"proteins":[104],"when":[105],"only":[106],"sequence":[107],"information":[108],"available.":[110],"tested":[115],"against":[116],"and":[119,133,138],"widely":[120],"used":[121],"techniques,":[122],"by":[123],"conducting":[124],"experiments":[128],"both":[131],"artificial":[132],"real":[134],"protein":[135],"sets":[137],"all":[139],"above":[140],"mentioned":[141],"were":[143],"confirmed.":[144]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
