{"id":"https://openalex.org/W2170493694","doi":"https://doi.org/10.1109/fuzzy.2006.1681719","title":"A Modified Fuzzy K-means Clustering using Expectation Maximization","display_name":"A Modified Fuzzy K-means Clustering using Expectation Maximization","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2170493694","doi":"https://doi.org/10.1109/fuzzy.2006.1681719","mag":"2170493694"},"language":"en","primary_location":{"id":"doi:10.1109/fuzzy.2006.1681719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzzy.2006.1681719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Fuzzy Systems","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/A5064325627","display_name":"Sara Nasser","orcid":"https://orcid.org/0000-0002-5719-7532"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Nasser","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058927962","display_name":"R. Alkhaldi","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Alkhaldi","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073215349","display_name":"Gregory Vert","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Vert","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064325627"],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":4.1916,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.94119482,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987999796867371,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9868999719619751,"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/T10057","display_name":"Face and Expression Recognition","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8274983167648315},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.6153745651245117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6000714302062988},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5920618772506714},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.5668836832046509},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5472055673599243},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5359331965446472},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.523517906665802},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5153100490570068},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.5108446478843689},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.46686291694641113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45508816838264465},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.45433786511421204},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42209330201148987},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40552207827568054},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.40102216601371765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33478015661239624},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3252484202384949},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.2053377330303192},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11740684509277344}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8274983167648315},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.6153745651245117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000714302062988},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5920618772506714},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.5668836832046509},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5472055673599243},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5359331965446472},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.523517906665802},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5153100490570068},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.5108446478843689},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.46686291694641113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45508816838264465},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.45433786511421204},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42209330201148987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40552207827568054},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40102216601371765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33478015661239624},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3252484202384949},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.2053377330303192},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11740684509277344},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/fuzzy.2006.1681719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzzy.2006.1681719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Fuzzy Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.133.6355","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unr.edu/~bioinfor/papers/fkemieee.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W179611734","https://openalex.org/W1489608363","https://openalex.org/W1539249290","https://openalex.org/W1592090717","https://openalex.org/W1611682757","https://openalex.org/W1869391892","https://openalex.org/W1955600018","https://openalex.org/W2001619934","https://openalex.org/W2004549407","https://openalex.org/W2011890649","https://openalex.org/W2049633694","https://openalex.org/W2065225722","https://openalex.org/W2073849744","https://openalex.org/W2085077509","https://openalex.org/W2094510831","https://openalex.org/W2097061887","https://openalex.org/W2101774527","https://openalex.org/W2113076747","https://openalex.org/W2127218421","https://openalex.org/W2128221272","https://openalex.org/W2164450870","https://openalex.org/W2798543290","https://openalex.org/W6629092883","https://openalex.org/W6635595544","https://openalex.org/W6639165917","https://openalex.org/W6678914141","https://openalex.org/W7048738093"],"related_works":["https://openalex.org/W3168768270","https://openalex.org/W3092684173","https://openalex.org/W3176177124","https://openalex.org/W2393816671","https://openalex.org/W4310575853","https://openalex.org/W1491908038","https://openalex.org/W2090567421","https://openalex.org/W2564491406","https://openalex.org/W1987634878","https://openalex.org/W3046546608"],"abstract_inverted_index":{"K-means":[0,16,30,102],"is":[1,17,41],"a":[2,8,42,55,78,87],"popular":[3],"clustering":[4,20],"algorithm":[5,65],"that":[6],"requires":[7],"huge":[9,79],"initial":[10],"set":[11],"to":[12,29,34,70],"start":[13],"the":[14,97],"clustering.":[15],"an":[18],"unsupervised":[19],"method":[21,99],"which":[22,74],"does":[23],"not":[24,76],"guarantee":[25,92],"convergence.":[26,93],"Numerous":[27],"improvements":[28],"have":[31],"been":[32],"done":[33],"make":[35],"its":[36],"performance":[37],"better.":[38],"Expectation":[39],"Maximization":[40],"statistical":[43],"technique":[44],"for":[45,54],"maximum":[46],"likelihood":[47],"estimation":[48],"using":[49],"mixture":[50],"models.":[51],"It":[52],"searches":[53],"local":[56],"maxima":[57],"and":[58,83,91],"generally":[59],"converges":[60],"very":[61],"well.":[62],"The":[63,94],"proposed":[64],"combines":[66],"these":[67],"two":[68],"algorithms":[69],"generate":[71],"optimum":[72],"clusters":[73],"do":[75],"require":[77],"value":[80],"of":[81],"K":[82],"each":[84],"cluster":[85],"attains":[86],"more":[88],"natural":[89],"shape":[90],"paper":[95],"compares":[96],"new":[98],"with":[100],"Fuzzy":[101],"on":[103],"benchmark":[104],"iris":[105],"data.":[106]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}