FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance

FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance fu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Dell'Amico, Matteo
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Dell'Amico, Matteo
description FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It is incremental and scalable: it avoids the $\mathcal O(n^2)$ performance of other approaches in non-metric spaces and requires only lightweight computation to update the clustering when few items are added. It is hierarchical: it produces a "flat" clustering which can be expanded to a tree structure, so that users can group and/or divide clusters in sub- or super-clusters when data exploration requires so. It is density-based and approximates HDBSCAN*, an evolution of DBSCAN.
doi_str_mv 10.48550/arxiv.1910.07283
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1910_07283</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1910_07283</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-5df0b8a679534494161bbc33d08d4df8bd8ea9f51abd9ae4891c1762c77cda3d3</originalsourceid><addsrcrecordid>eNotj0FOwzAQRb1hgQoHYIUP0JS4dhKbXZsQEqkSi3Yfje0JWHJd5BjU3p5QWM3X09fXPEIeWL4SsijyJ4hn971iagZ5tZb8lpzaft812_qZth7PTntc0j6YiEcMCfyS7g14uOLOYYRoPtxMaINhcumSbWFCS2v_NSWMLrzT8RTpJmqX5u6FNpCAQrC0cVOCYPCO3IzgJ7z_vwtyaF8OdZft3l77erPLoKx4Vtgx13KOquBCKMFKprXh3ObSCjtKbSWCGgsG2ipAIRUzrCrXpqqMBW75gjz-zV6Nh8_ojvM7w6_5cDXnPyi-U_A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance</title><source>arXiv.org</source><creator>Dell'Amico, Matteo</creator><creatorcontrib>Dell'Amico, Matteo</creatorcontrib><description>FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It is incremental and scalable: it avoids the $\mathcal O(n^2)$ performance of other approaches in non-metric spaces and requires only lightweight computation to update the clustering when few items are added. It is hierarchical: it produces a "flat" clustering which can be expanded to a tree structure, so that users can group and/or divide clusters in sub- or super-clusters when data exploration requires so. It is density-based and approximates HDBSCAN*, an evolution of DBSCAN.</description><identifier>DOI: 10.48550/arxiv.1910.07283</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2019-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1910.07283$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1910.07283$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Dell'Amico, Matteo</creatorcontrib><title>FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance</title><description>FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It is incremental and scalable: it avoids the $\mathcal O(n^2)$ performance of other approaches in non-metric spaces and requires only lightweight computation to update the clustering when few items are added. It is hierarchical: it produces a "flat" clustering which can be expanded to a tree structure, so that users can group and/or divide clusters in sub- or super-clusters when data exploration requires so. It is density-based and approximates HDBSCAN*, an evolution of DBSCAN.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj0FOwzAQRb1hgQoHYIUP0JS4dhKbXZsQEqkSi3Yfje0JWHJd5BjU3p5QWM3X09fXPEIeWL4SsijyJ4hn971iagZ5tZb8lpzaft812_qZth7PTntc0j6YiEcMCfyS7g14uOLOYYRoPtxMaINhcumSbWFCS2v_NSWMLrzT8RTpJmqX5u6FNpCAQrC0cVOCYPCO3IzgJ7z_vwtyaF8OdZft3l77erPLoKx4Vtgx13KOquBCKMFKprXh3ObSCjtKbSWCGgsG2ipAIRUzrCrXpqqMBW75gjz-zV6Nh8_ojvM7w6_5cDXnPyi-U_A</recordid><startdate>20191016</startdate><enddate>20191016</enddate><creator>Dell'Amico, Matteo</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20191016</creationdate><title>FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance</title><author>Dell'Amico, Matteo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-5df0b8a679534494161bbc33d08d4df8bd8ea9f51abd9ae4891c1762c77cda3d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Dell'Amico, Matteo</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dell'Amico, Matteo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance</atitle><date>2019-10-16</date><risdate>2019</risdate><abstract>FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It is incremental and scalable: it avoids the $\mathcal O(n^2)$ performance of other approaches in non-metric spaces and requires only lightweight computation to update the clustering when few items are added. It is hierarchical: it produces a "flat" clustering which can be expanded to a tree structure, so that users can group and/or divide clusters in sub- or super-clusters when data exploration requires so. It is density-based and approximates HDBSCAN*, an evolution of DBSCAN.</abstract><doi>10.48550/arxiv.1910.07283</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1910.07283
ispartof
issn
language eng
recordid cdi_arxiv_primary_1910_07283
source arXiv.org
subjects Computer Science - Data Structures and Algorithms
Computer Science - Learning
Statistics - Machine Learning
title FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T00%3A33%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=FISHDBC:%20Flexible,%20Incremental,%20Scalable,%20Hierarchical%20Density-Based%20Clustering%20for%20Arbitrary%20Data%20and%20Distance&rft.au=Dell'Amico,%20Matteo&rft.date=2019-10-16&rft_id=info:doi/10.48550/arxiv.1910.07283&rft_dat=%3Carxiv_GOX%3E1910_07283%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true