{"id":"https://openalex.org/W2164776003","doi":"https://doi.org/10.1109/icpr.2002.1047789","title":"Prototype selection for finding efficient representations of dissimilarity data","display_name":"Prototype selection for finding efficient representations of dissimilarity data","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2164776003","doi":"https://doi.org/10.1109/icpr.2002.1047789","mag":"2164776003"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2002.1047789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"},"type":"conference-paper","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/A5084835631","display_name":"El\u017cbieta P\u0119kalska","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"E. Pekalska","raw_affiliation_strings":["Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, Delft University of Technnology, Delft, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, Delft University of Technnology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109106696","display_name":"Robert P. W. Duin","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"R.P.W. Duin","raw_affiliation_strings":["Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, Delft University of Technnology, Delft, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, Delft University of Technnology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"37","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9932000041007996,"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"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9932000041007996,"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"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9909999966621399,"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"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9908999800682068,"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/computer-science","display_name":"Computer science","score":0.657206118106842},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.656798243522644},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.6498210430145264},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5956127047538757},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5700190663337708},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4908600449562073},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4873002767562866},{"id":"https://openalex.org/keywords/training-set","display_name":"Training set","score":0.44528618454933167},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4286411702632904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2886233329772949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.258439302444458}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.657206118106842},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.656798243522644},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.6498210430145264},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5956127047538757},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5700190663337708},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4908600449562073},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4873002767562866},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.44528618454933167},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4286411702632904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2886233329772949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.258439302444458},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icpr.2002.1047789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.1719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ph.tn.tudelft.nl/People/bob/papers/icpr_02_protsel.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7f7d7da9-827a-4252-b8e7-e7d798590f00","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/7f7d7da9-827a-4252-b8e7-e7d798590f00","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pekalska, E, P\u0229kalska, E & Duin, R P W 2002, Prototype selection for finding efficient representations of dissimilarity data. in Proceedings - International Conference on Pattern Recognition|Proc. Int. Conf. Pattern Recognit.. vol. 16, pp. 37-40. < http://dblp.uni-trier.de/db/conf/icpr/icpr2002-3.html#PekalskaD02 >","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/7f7d7da9-827a-4252-b8e7-e7d798590f00","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/rec/bibtex/conf/icpr/PekalskaD02.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pekalska, E, P\u0229kalska, E & Duin, R P W 2002, Prototype selection for finding efficient representations of dissimilarity data. in Proceedings - International Conference on Pattern Recognition|Proc. Int. Conf. Pattern Recognit.. vol. 16, pp. 37-40. < http://dblp.uni-trier.de/db/conf/icpr/icpr2002-3.html#PekalskaD02 >","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6600000262260437}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332178","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1586420997","https://openalex.org/W1587362683","https://openalex.org/W1979662950","https://openalex.org/W2107105977","https://openalex.org/W2140825458","https://openalex.org/W2143748099","https://openalex.org/W2157656721","https://openalex.org/W2166299063","https://openalex.org/W2495084345","https://openalex.org/W2888432050","https://openalex.org/W2903005364","https://openalex.org/W4205380271","https://openalex.org/W4256240203"],"related_works":["https://openalex.org/W2146076056","https://openalex.org/W2563096758","https://openalex.org/W4386053843","https://openalex.org/W3158004940","https://openalex.org/W2151973236","https://openalex.org/W2067903825","https://openalex.org/W2065974276","https://openalex.org/W894329006","https://openalex.org/W2008969034","https://openalex.org/W2086396635"],"abstract_inverted_index":{"The":[0],"nearest":[1],"neighbor":[2],"(NN)":[3],"rule":[4,165],"is":[5,29,46,138],"a":[6,54,68,73],"simple":[7],"and":[8,120,127],"intuitive":[9],"method":[10],"for":[11,90,140],"solving":[12],"classification":[13],"problems.":[14],"Originally,":[15],"it":[16,28],"uses":[17],"distances":[18,60],"to":[19,31,35],"the":[20,50,59,77,85,91,99,103,109,113,134,141,145,150,159,163],"complete":[21],"training":[22,86,104,160],"set.":[23],"It":[24],"performs":[25],"well,":[26],"however":[27],"sensitive":[30],"noisy":[32],"objects,":[33,161],"due":[34],"its":[36],"operation":[37],"on":[38,167],"local":[39],"neighborhoods":[40],"only.":[41],"A":[42],"more":[43],"global":[44],"approach":[45],"possible":[47],"by":[48,154],"mapping":[49],"distance":[51],"data":[52],"onto":[53],"pseudo-Euclidean":[55,151],"space,":[56,152],"such":[57,72],"that":[58,133],"are":[61,88,118],"preserved":[62],"as":[63,65],"well":[64],"possible.":[66],"Then,":[67],"classifier":[69,147],"built":[70,148],"in":[71,149],"space":[74],"can":[75],"outperform":[76],"NN":[78,164],"rule.":[79],"However,":[80],"again":[81],"all":[82,168],"objects":[83],"from":[84],"set":[87,105],"used":[89],"projection":[92],"of":[93,101,112,158,169],"new":[94],"data.":[95,115],"This":[96],"paper":[97],"addresses":[98],"issue":[100],"reducing":[102],"while":[106],"possibly":[107],"preserving":[108],"original":[110],"structure":[111],"mapped":[114],"Some":[116],"criteria":[117],"introduced":[119],"evaluated":[121],"against":[122],"two":[123],"problems,":[124],"polygon":[125],"recognition":[126],"digit":[128],"recognition.":[129],"Our":[130],"experiments":[131],"show":[132],"representation":[135],"mismatch":[136],"criterion":[137],"beneficial":[139],"applications":[142],"considered.":[143],"Moreover,":[144],"linear":[146],"determined":[153],"20%":[155],"-":[156],"25%":[157],"outperforms":[162],"based":[166],"them.":[170]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}