advanced-methods-practise-s.../w2/clustering-datasets/Description.rtf
2025-05-11 21:12:07 +02:00

9 lines
2.6 KiB
Plaintext
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

{\rtf1\ansi\ansicpg1252\deff0\nouicompat\deflang1031{\fonttbl{\f0\froman\fcharset0 Times New Roman;}{\f1\fnil\fcharset0 Calibri;}}
{\colortbl ;\red0\green0\blue255;}
{\*\generator Riched20 10.0.10240}\viewkind4\uc1
\pard\f0\fs24 Third column is the label. \par
\b Aggregation\b0\line N=788, M=7, D=2 \line\b Aggregation:\b0 {{\field{\*\fldinst{HYPERLINK "Aggregation.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Gionis, A., H. Mannila, and P. Tsaparas, Clustering aggregation. \i ACM Transactions on Knowledge Discovery from Data (TKDD)\i0 , 2007. 1(1): p. 1-30.\line\b Compound\b0\line N=399, M=6, D=2 \line\b Compound:\b0 {{\field{\*\fldinst{HYPERLINK "Compound.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Zahn, C.T., Graph-theoretical methods for detecting and describing gestalt clusters. \i IEEE Transactions on Computers\i0 , 1971. 100(1): p. 68-86. \line\b Pathbased\b0\line N=300, M=3, D=2 \line\b Pathbased:\b0 {{\field{\*\fldinst{HYPERLINK "pathbased.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Chang, H. and D.Y. Yeung, Robust path-based spectral clustering. \i Pattern Recognition\i0 , 2008. 41(1): p. 191-203. \line\b Spiral\b0\line N=312, M=3, D=2 \line\b Spiral:\b0 {{\field{\*\fldinst{HYPERLINK "spiral.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Chang, H. and D.Y. Yeung, Robust path-based spectral clustering. \i Pattern Recognition\i0 , 2008. 41(1): p. 191-203. \line\b D31\b0\line N=3100, M=31, D=2 \line\b D31:\b0 {{\field{\*\fldinst{HYPERLINK "D31.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Veenman, C.J., M.J.T. Reinders, and E. Backer, A maximum variance cluster algorithm. \i IEEE Trans. Pattern Analysis and Machine Intelligence\i0 2002. 24(9): p. 1273-1280. \line\b R15\b0\line N=600, M=15, D=2 \line\b R15:\b0 {{\field{\*\fldinst{HYPERLINK "R15.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Veenman, C.J., M.J.T. Reinders, and E. Backer, A maximum variance cluster algorithm. \i IEEE Trans. Pattern Analysis and Machine Intelligence\i0 , 2002. 24(9): p. 1273-1280. \line\b Jain\b0\line N=373, M=2, D=2 \line\b Jain:\b0 {{\field{\*\fldinst{HYPERLINK "jain.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Jain, A. and M. Law, Data clustering: A user's dilemma. \i Lecture Notes in Computer Science\i0 , 2005. 3776: p. 1-10. \line\b Flame\b0\line N=240, M=2, D=2 \line\b Flame:\b0 {{\field{\*\fldinst{HYPERLINK "flame.txt"}}{\fldrslt{\ul\cf1\cf1\ul txt}}}}\f0\fs24\line Fu, L. and E. Medico, FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data. \i BMC bioinformatics\i0 , 2007. 8(1): p. 3. \par
\pard\sa200\sl276\slmult1\f1\fs22\lang7\par
}