OPTICS: ordering points to identify the clustering structure. Ankerst, M., Breunig, M. M., Kriegel, H., & Sander, J. ACM SIGMOD Record, 28(2):49–60, June, 1999. ![OPTICS: ordering points to identify the clustering structure [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many real-data sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. This cluster-ordering contains information which is equivalent to the density-based clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only 'traditional' clustering information (e.g. representative points, arbitrary shaped clusters), but also the intrinsic clustering structure. For medium sized data sets, the cluster-ordering can be represented graphically and for very large data sets, we introduce an appropriate visualization technique. Both are suitable for interactive exploration of the intrinsic clustering structure offering additional insights into the distribution and correlation of the data.
@article{ankerst_optics_1999,
title = {{OPTICS}: ordering points to identify the clustering structure},
volume = {28},
issn = {0163-5808},
shorttitle = {{OPTICS}},
url = {https://doi.org/10.1145/304181.304187},
doi = {10.1145/304181.304187},
abstract = {Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many real-data sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. This cluster-ordering contains information which is equivalent to the density-based clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only 'traditional' clustering information (e.g. representative points, arbitrary shaped clusters), but also the intrinsic clustering structure. For medium sized data sets, the cluster-ordering can be represented graphically and for very large data sets, we introduce an appropriate visualization technique. Both are suitable for interactive exploration of the intrinsic clustering structure offering additional insights into the distribution and correlation of the data.},
number = {2},
urldate = {2023-02-15},
journal = {ACM SIGMOD Record},
author = {Ankerst, Mihael and Breunig, Markus M. and Kriegel, Hans-Peter and Sander, Jörg},
month = jun,
year = {1999},
keywords = {cluster analysis, database mining, visualization},
pages = {49--60},
}
Downloads: 0
{"_id":"3bSKPfnXWSSxg3Tos","bibbaseid":"ankerst-breunig-kriegel-sander-opticsorderingpointstoidentifytheclusteringstructure-1999","authorIDs":[],"author_short":["Ankerst, M.","Breunig, M. M.","Kriegel, H.","Sander, J."],"bibdata":{"bibtype":"article","type":"article","title":"OPTICS: ordering points to identify the clustering structure","volume":"28","issn":"0163-5808","shorttitle":"OPTICS","url":"https://doi.org/10.1145/304181.304187","doi":"10.1145/304181.304187","abstract":"Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many real-data sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. This cluster-ordering contains information which is equivalent to the density-based clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only 'traditional' clustering information (e.g. representative points, arbitrary shaped clusters), but also the intrinsic clustering structure. For medium sized data sets, the cluster-ordering can be represented graphically and for very large data sets, we introduce an appropriate visualization technique. Both are suitable for interactive exploration of the intrinsic clustering structure offering additional insights into the distribution and correlation of the data.","number":"2","urldate":"2023-02-15","journal":"ACM SIGMOD Record","author":[{"propositions":[],"lastnames":["Ankerst"],"firstnames":["Mihael"],"suffixes":[]},{"propositions":[],"lastnames":["Breunig"],"firstnames":["Markus","M."],"suffixes":[]},{"propositions":[],"lastnames":["Kriegel"],"firstnames":["Hans-Peter"],"suffixes":[]},{"propositions":[],"lastnames":["Sander"],"firstnames":["Jörg"],"suffixes":[]}],"month":"June","year":"1999","keywords":"cluster analysis, database mining, visualization","pages":"49–60","bibtex":"@article{ankerst_optics_1999,\n\ttitle = {{OPTICS}: ordering points to identify the clustering structure},\n\tvolume = {28},\n\tissn = {0163-5808},\n\tshorttitle = {{OPTICS}},\n\turl = {https://doi.org/10.1145/304181.304187},\n\tdoi = {10.1145/304181.304187},\n\tabstract = {Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many real-data sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. This cluster-ordering contains information which is equivalent to the density-based clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only 'traditional' clustering information (e.g. representative points, arbitrary shaped clusters), but also the intrinsic clustering structure. For medium sized data sets, the cluster-ordering can be represented graphically and for very large data sets, we introduce an appropriate visualization technique. Both are suitable for interactive exploration of the intrinsic clustering structure offering additional insights into the distribution and correlation of the data.},\n\tnumber = {2},\n\turldate = {2023-02-15},\n\tjournal = {ACM SIGMOD Record},\n\tauthor = {Ankerst, Mihael and Breunig, Markus M. and Kriegel, Hans-Peter and Sander, Jörg},\n\tmonth = jun,\n\tyear = {1999},\n\tkeywords = {cluster analysis, database mining, visualization},\n\tpages = {49--60},\n}\n\n\n\n","author_short":["Ankerst, M.","Breunig, M. M.","Kriegel, H.","Sander, J."],"key":"ankerst_optics_1999","id":"ankerst_optics_1999","bibbaseid":"ankerst-breunig-kriegel-sander-opticsorderingpointstoidentifytheclusteringstructure-1999","role":"author","urls":{"Paper":"https://doi.org/10.1145/304181.304187"},"keyword":["cluster analysis","database mining","visualization"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","creationDate":"2019-11-19T16:50:41.460Z","downloads":0,"keywords":["cluster analysis","database mining","visualization"],"search_terms":["optics","ordering","points","identify","clustering","structure","ankerst","breunig","kriegel","sander"],"title":"OPTICS: ordering points to identify the clustering structure","year":1999,"dataSources":["C5FtkvWWggFfMJTFX","rx3H6duFmTt3xD5yy","iwKepCrWBps7ojhDx"]}