Improved Perron cluster analysis:
Abstract: "The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. [9] have proposed an algorithm that states the number k of clusters and uses the sign structure of k eigenvectors of the stoc...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
2003
|
| Series: | ZIB-Report
2003,04 |
| Subjects: | |
| Summary: | Abstract: "The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. [9] have proposed an algorithm that states the number k of clusters and uses the sign structure of k eigenvectors of the stochastic matrix to solve the cluster problem. Recently Weber and Galliat [8] discovered that this system of eigenvectors can easily be transformed into a system of k membership functions or soft characteristic functions describing the clusters. In this article we explain the corresponding cluster algorithm and point out the underlying theory. By means of numerical examples we explain how the grade of membership can be interpreted." |
| Physical Description: | 9 S. 1 Ill., graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV023035416 | ||
| 003 | DE-604 | ||
| 005 | 20191118 | ||
| 007 | t| | ||
| 008 | 071205s2003 xx ad|| |||| 00||| eng d | ||
| 035 | |a (OCoLC)52753585 | ||
| 035 | |a (DE-599)BVBBV023035416 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 100 | 1 | |a Weber, Marcus |d 1972- |e Verfasser |0 (DE-588)132289881 |4 aut | |
| 245 | 1 | 0 | |a Improved Perron cluster analysis |c Marcus Weber |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 2003 | |
| 300 | |a 9 S. |b 1 Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIB-Report |v 2003,04 | |
| 520 | 3 | |a Abstract: "The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. [9] have proposed an algorithm that states the number k of clusters and uses the sign structure of k eigenvectors of the stochastic matrix to solve the cluster problem. Recently Weber and Galliat [8] discovered that this system of eigenvectors can easily be transformed into a system of k membership functions or soft characteristic functions describing the clusters. In this article we explain the corresponding cluster algorithm and point out the underlying theory. By means of numerical examples we explain how the grade of membership can be interpreted." | |
| 650 | 4 | |a Cluster analysis | |
| 650 | 4 | |a Stochastic matrices | |
| 830 | 0 | |a ZIB-Report |v 2003,04 |w (DE-604)BV013191727 |9 2003,04 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016239211 | |
Record in the Search Index
| _version_ | 1820882437559812096 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Weber, Marcus 1972- |
| author_GND | (DE-588)132289881 |
| author_facet | Weber, Marcus 1972- |
| author_role | aut |
| author_sort | Weber, Marcus 1972- |
| author_variant | m w mw |
| building | Verbundindex |
| bvnumber | BV023035416 |
| classification_rvk | SS 4779 |
| ctrlnum | (OCoLC)52753585 (DE-599)BVBBV023035416 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV023035416</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20191118</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">071205s2003 xx ad|| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52753585</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023035416</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Weber, Marcus</subfield><subfield code="d">1972-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132289881</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Improved Perron cluster analysis</subfield><subfield code="c">Marcus Weber</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 S.</subfield><subfield code="b">1 Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">ZIB-Report</subfield><subfield code="v">2003,04</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. [9] have proposed an algorithm that states the number k of clusters and uses the sign structure of k eigenvectors of the stochastic matrix to solve the cluster problem. Recently Weber and Galliat [8] discovered that this system of eigenvectors can easily be transformed into a system of k membership functions or soft characteristic functions describing the clusters. In this article we explain the corresponding cluster algorithm and point out the underlying theory. By means of numerical examples we explain how the grade of membership can be interpreted."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cluster analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic matrices</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ZIB-Report</subfield><subfield code="v">2003,04</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2003,04</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016239211</subfield></datafield></record></collection> |
| id | DE-604.BV023035416 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:18:42Z |
| indexdate | 2025-01-10T17:06:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016239211 |
| oclc_num | 52753585 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 9 S. 1 Ill., graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | ZIB-Report |
| series2 | ZIB-Report |
| spelling | Weber, Marcus 1972- Verfasser (DE-588)132289881 aut Improved Perron cluster analysis Marcus Weber Berlin Konrad-Zuse-Zentrum für Informationstechnik 2003 9 S. 1 Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier ZIB-Report 2003,04 Abstract: "The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. [9] have proposed an algorithm that states the number k of clusters and uses the sign structure of k eigenvectors of the stochastic matrix to solve the cluster problem. Recently Weber and Galliat [8] discovered that this system of eigenvectors can easily be transformed into a system of k membership functions or soft characteristic functions describing the clusters. In this article we explain the corresponding cluster algorithm and point out the underlying theory. By means of numerical examples we explain how the grade of membership can be interpreted." Cluster analysis Stochastic matrices ZIB-Report 2003,04 (DE-604)BV013191727 2003,04 |
| spellingShingle | Weber, Marcus 1972- Improved Perron cluster analysis ZIB-Report Cluster analysis Stochastic matrices |
| title | Improved Perron cluster analysis |
| title_auth | Improved Perron cluster analysis |
| title_exact_search | Improved Perron cluster analysis |
| title_exact_search_txtP | Improved Perron cluster analysis |
| title_full | Improved Perron cluster analysis Marcus Weber |
| title_fullStr | Improved Perron cluster analysis Marcus Weber |
| title_full_unstemmed | Improved Perron cluster analysis Marcus Weber |
| title_short | Improved Perron cluster analysis |
| title_sort | improved perron cluster analysis |
| topic | Cluster analysis Stochastic matrices |
| topic_facet | Cluster analysis Stochastic matrices |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT webermarcus improvedperronclusteranalysis |