Abstract
This paper introduces the first generic version of data dependent dissimilarity and shows that it provides a better closest match than distance measures for three existing algorithms in clustering, anomaly detection and multi-label classification. For each algorithm, we show that by simply replacing the distance measure with the data dependent dissimilarity measure, it overcomes a key weakness of the otherwise unchanged algorithm.
Original language | English |
---|---|
Title of host publication | Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2016) |
Subtitle of host publication | August 13-17, 2016, San Francisco, CA, USA |
Editors | Alex Smola, Charu Aggarwal, Dou Shen, Rajeev Rastogi |
Place of Publication | New York, New York |
Publisher | Association for Computing Machinery (ACM) |
Pages | 1205-1214 |
Number of pages | 10 |
ISBN (Electronic) | 9781450342322 |
DOIs | |
Publication status | Published - 13 Aug 2016 |
Event | ACM International Conference on Knowledge Discovery and Data Mining 2016 - Hilton San Francisco Union Square, San Francisco, United States of America Duration: 13 Aug 2016 → 17 Aug 2016 Conference number: 22nd http://www.kdd.org/kdd2016/ https://dl.acm.org/doi/proceedings/10.1145/2939672 |
Conference
Conference | ACM International Conference on Knowledge Discovery and Data Mining 2016 |
---|---|
Abbreviated title | KDD 2016 |
Country/Territory | United States of America |
City | San Francisco |
Period | 13/08/16 → 17/08/16 |
Other | KDD 2016, a premier interdisciplinary conference, brings together researchers and practitioners from data science, data mining, knowledge discovery, large-scale data analytics, and big data. |
Internet address |
Keywords
- Data dependent dissimilarity
- Distance-based neighbourhood
- Distance measure
- K nearest neighbours
- Probability-mass-based neighbourhood