{"id":"https://openalex.org/W2037184328","doi":"https://doi.org/10.2478/amcs-2014-0012","title":"Center-based l1\u2013clustering method","display_name":"Center-based l1\u2013clustering method","publication_year":2014,"publication_date":"2014-03-01","ids":{"openalex":"https://openalex.org/W2037184328","doi":"https://doi.org/10.2478/amcs-2014-0012","mag":"2037184328"},"language":"en","primary_location":{"id":"doi:10.2478/amcs-2014-0012","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2014-0012","pdf_url":"https://sciendo.com/pdf/10.2478/amcs-2014-0012","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://sciendo.com/pdf/10.2478/amcs-2014-0012","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046704457","display_name":"Kristian Sabo","orcid":"https://orcid.org/0000-0002-1787-3161"},"institutions":[{"id":"https://openalex.org/I51314090","display_name":"University of Osijek","ror":"https://ror.org/05sw4wc49","country_code":"HR","type":"education","lineage":["https://openalex.org/I51314090"]}],"countries":["HR"],"is_corresponding":true,"raw_author_name":"Kristian Sabo","raw_affiliation_strings":["Department of Mathematics, University of Osijek, Trg Lj. Gaja 6, HR - 31 000 Osijek, Croatia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Osijek, Trg Lj. Gaja 6, HR - 31 000 Osijek, Croatia#TAB#","institution_ids":["https://openalex.org/I51314090"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046704457"],"corresponding_institution_ids":["https://openalex.org/I51314090"],"apc_list":{"value":4080,"currency":"PLN","value_usd":1100},"apc_paid":{"value":4080,"currency":"PLN","value_usd":1100},"fwci":4.8208,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.9508652,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"1","first_page":"151","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8511962890625},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6323741674423218},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6194915175437927},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6008303165435791},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.5181925892829895},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5169026851654053},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.4909229874610901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4667886197566986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4557052552700043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43667343258857727},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4307194948196411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43070825934410095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20471876859664917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14815521240234375}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8511962890625},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6323741674423218},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6194915175437927},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6008303165435791},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.5181925892829895},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5169026851654053},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4909229874610901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4667886197566986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4557052552700043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43667343258857727},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4307194948196411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43070825934410095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20471876859664917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14815521240234375},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2478/amcs-2014-0012","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2014-0012","pdf_url":"https://sciendo.com/pdf/10.2478/amcs-2014-0012","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:zbc.uz.zgora.pl:78922","is_oa":false,"landing_page_url":"https://zbc.uz.zgora.pl/dlibra/docmetadata?showContent=true&id=78922","pdf_url":null,"source":{"id":"https://openalex.org/S4306400400","display_name":"Digital library of Zielona Gora (University of Zielona G\u00f3ra)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I46305939","host_organization_name":"University of Zielona G\u00f3ra","host_organization_lineage":["https://openalex.org/I46305939"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.amcs.uz.zgora.pl/?action=papers&issue=56","raw_type":"artyku\u0142"}],"best_oa_location":{"id":"doi:10.2478/amcs-2014-0012","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2014-0012","pdf_url":"https://sciendo.com/pdf/10.2478/amcs-2014-0012","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325733","display_name":"Sveu\u010dili\u0161te Josipa Jurja Strossmayera u Osijeku","ror":"https://ror.org/05sw4wc49"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2037184328.pdf"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W396542372","https://openalex.org/W1488413262","https://openalex.org/W1499832780","https://openalex.org/W1542365154","https://openalex.org/W1551360398","https://openalex.org/W1594924988","https://openalex.org/W1691922376","https://openalex.org/W1969981860","https://openalex.org/W1979607399","https://openalex.org/W1981053775","https://openalex.org/W1987356290","https://openalex.org/W1990263288","https://openalex.org/W2002579073","https://openalex.org/W2004787246","https://openalex.org/W2010555243","https://openalex.org/W2010642019","https://openalex.org/W2014181044","https://openalex.org/W2015653412","https://openalex.org/W2019310766","https://openalex.org/W2028980981","https://openalex.org/W2031058459","https://openalex.org/W2040324983","https://openalex.org/W2044971577","https://openalex.org/W2056789502","https://openalex.org/W2062325778","https://openalex.org/W2066576934","https://openalex.org/W2068143018","https://openalex.org/W2069391269","https://openalex.org/W2073149227","https://openalex.org/W2074869363","https://openalex.org/W2088086447","https://openalex.org/W2105422913","https://openalex.org/W2107802091","https://openalex.org/W2113076747","https://openalex.org/W2113741278","https://openalex.org/W2137340484","https://openalex.org/W2138036661","https://openalex.org/W2141595746","https://openalex.org/W2168087308","https://openalex.org/W2263438536","https://openalex.org/W2296319761","https://openalex.org/W2320797593","https://openalex.org/W2611293703","https://openalex.org/W2799061466","https://openalex.org/W2895397838","https://openalex.org/W3021105684","https://openalex.org/W3022335129","https://openalex.org/W3148421669","https://openalex.org/W4206222429","https://openalex.org/W4239875977","https://openalex.org/W4249455597","https://openalex.org/W4299439662"],"related_works":["https://openalex.org/W2160785859","https://openalex.org/W1525022337","https://openalex.org/W3146523624","https://openalex.org/W2390610678","https://openalex.org/W3140018618","https://openalex.org/W2171583777","https://openalex.org/W2186905933","https://openalex.org/W2407786351","https://openalex.org/W2146999194","https://openalex.org/W2555816786"],"abstract_inverted_index":{"Abstract":[0],"In":[1,23],"this":[2,138],"paper,":[3,69],"we":[4],"consider":[5],"the":[6,26,68,70,73,80,99,107,121,126,129,141,153],"l1-clustering":[7,143],"problem":[8],"for":[9,60],"a":[10,51,61,110,115],"finite":[11],"data-point":[12],"set":[13],"which":[14,102],"should":[15],"be":[16,33],"partitioned":[17],"into":[18],"k":[19],"disjoint":[20],"nonempty":[21],"subsets.":[22],"that":[24,140],"case,":[25],"objective":[27],"function":[28],"does":[29],"not":[30],"have":[31,42],"to":[32],"either":[34],"convex":[35],"or":[36,45],"differentiable,":[37],"and":[38,79,90,128,147],"generally":[39],"it":[40,49],"may":[41],"many":[43],"local":[44],"global":[46,53],"minima.":[47],"Therefore,":[48],"becomes":[50],"complex":[52],"optimization":[54],"problem.":[55],"A":[56],"method":[57,86],"of":[58,72,123,131],"searching":[59],"locally":[62],"optimal":[63],"solution":[64],"is":[65,77,83,87,103,145],"proposed":[66,142],"in":[67,106,137],"convergence":[71],"corresponding":[74,81],"iterative":[75],"process":[76],"proved":[78],"algorithm":[82,144],"given.":[84],"The":[85],"illustrated":[88],"by":[89],"compared":[91],"with":[92,98],"some":[93],"other":[94],"clustering":[95,130],"methods,":[96],"especially":[97],"l2-clustering":[100,154],"method,":[101,113],"also":[104],"known":[105],"literature":[108],"as":[109,120],"smooth":[111],"k-means":[112],"on":[114],"few":[116],"typical":[117],"situations,":[118],"such":[119],"presence":[122],"outliers":[124],"among":[125],"data":[127],"incomplete":[132],"data.":[133],"Numerical":[134],"experiments":[135],"show":[136],"case":[139],"faster":[146],"gives":[148],"significantly":[149],"better":[150],"results":[151],"than":[152],"algorithm.":[155]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}