Automatic subspace clustering of high dimensional data for data mining applications
A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the dat...
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Patent |
| 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 | GUNOPULOS DIMITRIOS RAGHAVAN PRABHAKAR GEHRKE JOHANNES ERNST AGRAWAL RAKESH |
| description | A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6003029A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6003029A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6003029A3</originalsourceid><addsrcrecordid>eNqFjbsKAjEQRdNYiPoNzg8IwQXBchHFfrVexuxkdyCZhJ3k_332VucWh3uWpmtrSRELO9D60IyOwIWqhWaWEZKHiccJBo4kykkwwIAFwaf5OyLLW8ScA7vXTxJdm4XHoLT5cWW2l_PtdN1RTj19GkKlv3cHaxu7P7bNf-MJrjU4FQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Automatic subspace clustering of high dimensional data for data mining applications</title><source>esp@cenet</source><creator>GUNOPULOS; DIMITRIOS ; RAGHAVAN; PRABHAKAR ; GEHRKE; JOHANNES ERNST ; AGRAWAL; RAKESH</creator><creatorcontrib>GUNOPULOS; DIMITRIOS ; RAGHAVAN; PRABHAKAR ; GEHRKE; JOHANNES ERNST ; AGRAWAL; RAKESH</creatorcontrib><description>A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.</description><edition>6</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; HANDLING RECORD CARRIERS ; PHYSICS ; PRESENTATION OF DATA ; RECOGNITION OF DATA ; RECORD CARRIERS</subject><creationdate>1999</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19991214&DB=EPODOC&CC=US&NR=6003029A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19991214&DB=EPODOC&CC=US&NR=6003029A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GUNOPULOS; DIMITRIOS</creatorcontrib><creatorcontrib>RAGHAVAN; PRABHAKAR</creatorcontrib><creatorcontrib>GEHRKE; JOHANNES ERNST</creatorcontrib><creatorcontrib>AGRAWAL; RAKESH</creatorcontrib><title>Automatic subspace clustering of high dimensional data for data mining applications</title><description>A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>HANDLING RECORD CARRIERS</subject><subject>PHYSICS</subject><subject>PRESENTATION OF DATA</subject><subject>RECOGNITION OF DATA</subject><subject>RECORD CARRIERS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1999</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqFjbsKAjEQRdNYiPoNzg8IwQXBchHFfrVexuxkdyCZhJ3k_332VucWh3uWpmtrSRELO9D60IyOwIWqhWaWEZKHiccJBo4kykkwwIAFwaf5OyLLW8ScA7vXTxJdm4XHoLT5cWW2l_PtdN1RTj19GkKlv3cHaxu7P7bNf-MJrjU4FQ</recordid><startdate>19991214</startdate><enddate>19991214</enddate><creator>GUNOPULOS; DIMITRIOS</creator><creator>RAGHAVAN; PRABHAKAR</creator><creator>GEHRKE; JOHANNES ERNST</creator><creator>AGRAWAL; RAKESH</creator><scope>EVB</scope></search><sort><creationdate>19991214</creationdate><title>Automatic subspace clustering of high dimensional data for data mining applications</title><author>GUNOPULOS; DIMITRIOS ; RAGHAVAN; PRABHAKAR ; GEHRKE; JOHANNES ERNST ; AGRAWAL; RAKESH</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6003029A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1999</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>HANDLING RECORD CARRIERS</topic><topic>PHYSICS</topic><topic>PRESENTATION OF DATA</topic><topic>RECOGNITION OF DATA</topic><topic>RECORD CARRIERS</topic><toplevel>online_resources</toplevel><creatorcontrib>GUNOPULOS; DIMITRIOS</creatorcontrib><creatorcontrib>RAGHAVAN; PRABHAKAR</creatorcontrib><creatorcontrib>GEHRKE; JOHANNES ERNST</creatorcontrib><creatorcontrib>AGRAWAL; RAKESH</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GUNOPULOS; DIMITRIOS</au><au>RAGHAVAN; PRABHAKAR</au><au>GEHRKE; JOHANNES ERNST</au><au>AGRAWAL; RAKESH</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Automatic subspace clustering of high dimensional data for data mining applications</title><date>1999-12-14</date><risdate>1999</risdate><abstract>A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US6003029A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING HANDLING RECORD CARRIERS PHYSICS PRESENTATION OF DATA RECOGNITION OF DATA RECORD CARRIERS |
| title | Automatic subspace clustering of high dimensional data for data mining applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T08%3A11%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=GUNOPULOS;%20DIMITRIOS&rft.date=1999-12-14&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6003029A%3C/epo_EVB%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 |