{"id":"https://openalex.org/W2922135571","doi":"https://doi.org/10.3233/jcm-190004","title":"An improved MkNN clustering algorithm based on graph theory and membrane computing","display_name":"An improved MkNN clustering algorithm based on graph theory and membrane computing","publication_year":2019,"publication_date":"2019-03-08","ids":{"openalex":"https://openalex.org/W2922135571","doi":"https://doi.org/10.3233/jcm-190004","mag":"2922135571"},"language":"en","primary_location":{"id":"doi:10.3233/jcm-190004","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-190004","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences and Engineering","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/A5100327797","display_name":"Xin Wang","orcid":"https://orcid.org/0000-0001-6364-8275"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xin Wang","raw_affiliation_strings":["["],"affiliations":[{"raw_affiliation_string":"[","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040643591","display_name":"Xiyu Liu","orcid":"https://orcid.org/0000-0003-4976-9227"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiyu Liu","raw_affiliation_strings":["["],"affiliations":[{"raw_affiliation_string":"[","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101656749","display_name":"Hui Yu","orcid":"https://orcid.org/0000-0001-8670-9990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hui Yu","raw_affiliation_strings":["["],"affiliations":[{"raw_affiliation_string":"[","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040643591"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1705,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50776475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"3","first_page":"603","last_page":"617"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9768000245094299,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8253631591796875},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6532774567604065},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.6242622137069702},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.6070122718811035},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5959151387214661},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.5658983588218689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5621035099029541},{"id":"https://openalex.org/keywords/affinity-propagation","display_name":"Affinity propagation","score":0.5517477989196777},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48571595549583435},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.4721560478210449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44037407636642456},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.43897777795791626},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.43393510580062866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3359801471233368},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.33121564984321594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21822652220726013}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8253631591796875},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6532774567604065},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.6242622137069702},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.6070122718811035},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5959151387214661},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.5658983588218689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5621035099029541},{"id":"https://openalex.org/C109659709","wikidata":"https://www.wikidata.org/wiki/Q3407504","display_name":"Affinity propagation","level":5,"score":0.5517477989196777},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48571595549583435},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4721560478210449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44037407636642456},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.43897777795791626},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.43393510580062866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3359801471233368},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33121564984321594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21822652220726013}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jcm-190004","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-190004","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W978962911","https://openalex.org/W1498574646","https://openalex.org/W1543758866","https://openalex.org/W1639137466","https://openalex.org/W1840446470","https://openalex.org/W1984586189","https://openalex.org/W1985258161","https://openalex.org/W1995799881","https://openalex.org/W2004006927","https://openalex.org/W2021855712","https://openalex.org/W2070318008","https://openalex.org/W2094590527","https://openalex.org/W2097968973","https://openalex.org/W2115404543","https://openalex.org/W2120529703","https://openalex.org/W2132914434","https://openalex.org/W2158708642","https://openalex.org/W2314139964","https://openalex.org/W2355235100","https://openalex.org/W2462473771","https://openalex.org/W2514648191","https://openalex.org/W2532651643","https://openalex.org/W2553264745","https://openalex.org/W2555516547","https://openalex.org/W2801059242","https://openalex.org/W6649397586","https://openalex.org/W6729723838","https://openalex.org/W6730012951","https://openalex.org/W6876544943"],"related_works":["https://openalex.org/W2362911195","https://openalex.org/W2794209582","https://openalex.org/W2352610727","https://openalex.org/W2245611357","https://openalex.org/W2358586643","https://openalex.org/W2065347048","https://openalex.org/W2897883632","https://openalex.org/W2567087402","https://openalex.org/W2181939267","https://openalex.org/W4205473826"],"abstract_inverted_index":{"This":[0],"paper":[1],"combines":[2],"the":[3,11,49,56,100,107,114,153,157,166],"graph":[4,32,40,76],"theory":[5,33],"and":[6,23,31,58,70,103,148,171,187],"P":[7,62,66,77,172],"system":[8,67,78],"to":[9,16,34,46,105,131,143,151],"solve":[10,106],"clustering":[12,29,42,90,94,108,180,191],"problem.":[13,109],"In":[14,44],"order":[15,45],"effectively":[17],"identify":[18],"clusters":[19,155],"with":[20,68],"arbitrary":[21],"shapes":[22,188],"uneven":[24],"densities,":[25],"we":[26],"combine":[27],"MkNN":[28],"algorithm":[30,91,95,111,164],"propose":[35],"a":[36,64,88],"mutual":[37,73,145],"k-nearest":[38,74,133,146],"neighbors":[39,75,134,147],"(MkNNG)":[41],"algorithm.":[43],"further":[47],"improve":[48],"efficiency":[50],"of":[51,61,135,168,184],"MkNNG":[52,150,170],"algorithm,":[53],"based":[54,84],"on":[55,85],"non-determinism":[57],"great":[59],"parallelism":[60],"system,":[63,87],"cell-like":[65],"multi-promoters":[69],"multi-inhibitors":[71],"named":[72,92],"(MkNNG-P)":[79],"is":[80,96,141],"designed.":[81],"And":[82],"then":[83,126],"MkNNG-P":[86,93,110,163],"novel":[89],"proposed,":[97],"which":[98],"uses":[99,128],"membrane":[101,130,140],"objects":[102],"rules":[104],"first":[112],"calculates":[113],"dissimilarity":[115],"between":[116],"any":[117],"two":[118],"nodes":[119],"in":[120,123,156],"n-1":[121],"membranes":[122],"parallel.":[124],"After":[125],"it":[127],"one":[129,139],"get":[132],"n":[136],"nodes.":[137],"Finally,":[138],"used":[142],"find":[144],"construct":[149],"discover":[152],"natural":[154],"data":[158,183],"set.":[159],"Experiments":[160],"show":[161],"that":[162],"has":[165,195],"advantages":[167],"both":[169],"system.":[173],"It":[174],"not":[175],"only":[176],"can":[177],"obtain":[178],"good":[179],"quality":[181],"for":[182],"different":[185],"sizes":[186],"without":[189],"presetting":[190],"numbers,":[192],"but":[193],"also":[194],"extremely":[196],"high":[197],"computing":[198],"speed.":[199]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}