{"id":"https://openalex.org/W123086995","doi":null,"title":"Supervised Generative Models for Learning Dissimilarity Data","display_name":"Supervised Generative Models for Learning Dissimilarity Data","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W123086995","mag":"123086995"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.434.6425","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.6425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-91.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5088903370","display_name":"David Nebel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Nebel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091180862","display_name":"Barbara Hammer","orcid":"https://orcid.org/0000-0002-0935-5591","observed_orcids":["https://orcid.org/0000-0002-0935-5591"]},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Barbara Hammer","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0935-5591","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027248793","display_name":"Thomas Villmann","orcid":"https://orcid.org/0000-0001-6725-0141","observed_orcids":["https://orcid.org/0000-0001-6725-0141"]},"institutions":[{"id":"https://openalex.org/I116397343","display_name":"Hochschule Mittweida","ror":"https://ror.org/024ga3r86","country_code":"DE","type":"education","lineage":["https://openalex.org/I116397343"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Villmann","raw_affiliation_strings":["Hochschule Mittweida, Mittweida, Germany"],"raw_orcid":"https://orcid.org/0000-0001-6725-0141","affiliations":[{"raw_affiliation_string":"Hochschule Mittweida, Mittweida, Germany","institution_ids":["https://openalex.org/I116397343"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8947,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77696552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.5692999958992004,"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.5692999958992004,"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.1534000039100647,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.05249999836087227,"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/exemplar-models","display_name":"exemplar models","score":0.800000011920929},{"id":"https://openalex.org/keywords/affinity-propagation","display_name":"affinity propagation","score":0.8849999904632568},{"id":"https://openalex.org/keywords/dissimilarity-data","display_name":"dissimilarity data","score":0.8809999823570251},{"id":"https://openalex.org/keywords/discriminative-classifiers","display_name":"discriminative classifiers","score":0.6610000133514404},{"id":"https://openalex.org/keywords/sparse-modeling","display_name":"sparse models","score":0.8479999899864197},{"id":"https://openalex.org/keywords/interpretable-classifiers","display_name":"interpretable classifiers","score":0.49000000953674316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7132155299186707},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.6514824032783508},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6151731610298157},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.5914798974990845},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4830363690853119},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.4347268044948578},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3598763346672058},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08047834038734436}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.434.6425","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.6425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-91.pdf","raw_type":"text"},{"id":"pmh:oai:pub.librecat.org:2673545","doi":null,"is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2673545","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nebel D, Hammer B, Villmann T. Supervised Generative Models for Learning Dissimilarity Data. In: Verleysen M, ed. &lt;em&gt;ESANN, 22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning&lt;/em&gt;. Bruges, Belgium: i6doc.com; 2014: 35-40.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pub.uni-bielefeld.de:2673545","doi":null,"is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2673545","pdf_url":null,"source":{"id":"https://openalex.org/S4306401624","display_name":"Publikationen an der Universit\u00e4t Bielefeld (Universit\u00e4t Bielefeld)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nebel D, Hammer B, Villmann T. Supervised Generative Models for Learning Dissimilarity Data. In: Verleysen M, ed. &lt;em&gt;ESANN, 22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning&lt;/em&gt;. Bruges, Belgium: i6doc.com; 2014: 35-40.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:123086995","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/esann/esann2014.html#NebelHV14","pdf_url":null,"source":{"id":"https://openalex.org/S4306421047","display_name":"The European Symposium on Artificial Neural Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The European Symposium on Artificial Neural Networks","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W108285666","https://openalex.org/W1480708938","https://openalex.org/W1679913846","https://openalex.org/W1808967201","https://openalex.org/W2008255964","https://openalex.org/W2008918578","https://openalex.org/W2019377636","https://openalex.org/W2034306613","https://openalex.org/W2037080954","https://openalex.org/W2039434802","https://openalex.org/W2049633694","https://openalex.org/W2109993655","https://openalex.org/W2110994494","https://openalex.org/W2124067153","https://openalex.org/W2165232124","https://openalex.org/W2188797070","https://openalex.org/W2296528622","https://openalex.org/W2567948266","https://openalex.org/W2913977324"],"related_works":["https://openalex.org/W2188797070","https://openalex.org/W7100062790","https://openalex.org/W826990995","https://openalex.org/W2137304241","https://openalex.org/W599037623","https://openalex.org/W2401282352","https://openalex.org/W150879105","https://openalex.org/W7096907125","https://openalex.org/W1999036405","https://openalex.org/W7096958479"],"abstract_inverted_index":{"Abstract.":[0],"Exemplar":[1],"based":[2,59,116],"techniques":[3,60],"such":[4,69],"as":[5,39],"affinity":[6],"propagation":[7],"[1]":[8],"represent":[9,129],"data":[10,40,97,130],"in":[11,35,64,73,98,111,131,140],"terms":[12,132],"of":[13,90,133],"typical":[14],"exemplars.":[15],"This":[16],"has":[17],"two":[18],"benefits:":[19],"(i)":[20],"the":[21,36,43,65,82,88],"resulting":[22,127],"models":[23,93,135],"are":[24],"directly":[25],"interpretable":[26],"by":[27],"humans":[28],"since":[29],"representative":[30],"exemplars":[31],"can":[32,45,77],"be":[33,46,78],"inspected":[34],"same":[37],"way":[38],"points,":[41],"(ii)":[42],"model":[44,109],"applied":[47],"to":[48,113],"any":[49],"dissimilarity":[50,96],"measure":[51],"including":[52],"non-Euclidean":[53],"or":[54],"non-metric":[55],"settings.":[56],"Most":[57],"exemplar":[58,115],"have":[61],"been":[62],"proposed":[63,110],"unsupervised":[66],"setting":[67],"only,":[68],"that":[70],"their":[71],"performance":[72,139],"supervised":[74],"learning":[75,91],"tasks":[76],"weak":[79],"depending":[80],"on":[81],"given":[83],"data.":[84],"Here,":[85],"we":[86,105],"address":[87],"problem":[89],"exemplar-based":[92],"for":[94,123],"general":[95],"a":[99,107,119],"discriminative":[100],"framework.":[101],"For":[102],"this":[103],"purpose,":[104],"extend":[106],"generative":[108],"[2]":[112],"an":[114],"scenario":[117],"using":[118],"generalized":[120],"EM":[121],"framework":[122],"its":[124],"optimization.":[125],"The":[126],"classifiers":[128],"sparse":[134],"while":[136],"keeping":[137],"high":[138],"state-of-the":[141],"art":[142],"benchmarks.":[143],"1":[144]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-09-09T07:26:56.047234","created_date":"2016-06-24T00:00:00"}
