南開科技大學圖書館 |

回首頁

Non-redundant clustering.

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	Non-redundant clustering./
作者:	Gondek, David.
面頁冊數:	154 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-05, Section: B, page: 2675.
Contained By:	Dissertation Abstracts International66-05B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3174612
ISBN:	9780542127724

Non-redundant clustering.
LDR:02326nmm 2200265 4500 001 1000004712
005 20061114130244.5
008 061114s2005 eng d
020 $a 9780542127724
035 $a (UnM)AAI3174612
035 $a AAI3174612
040 $a UnM $c UnM{me_controlnum}
100 1 $a Gondek, David. $3 1000005773
245 1 0 $a Non-redundant clustering.
300 $a 154 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-05, Section: B, page: 2675.
500 $a Adviser: Thomas Hofmann.
502 $a Thesis (Ph.D.)--Brown University, 2005.
520 $a Data mining and knowledge discovery attempt to reveal concepts, patterns, relationships, and structures of interest in data. Typically, data may have many such structures. Most existing data mining techniques allow the user little say in which structure will be returned from the search. Those techniques which do allow the user control over the search typically require supervised information in the form of knowledge about a target solution. In the spirit of exploratory data mining, we consider the setting where the user does not have information about a target solution. Instead we suppose the user can provide information about solutions which are not desired . These undesired solutions may be previously obtained from data mining algorithms, or they may be known to the user a priori. The goal is then to discover novel structure in the dataset which is not redundant with respect to the known structure. Techniques should guide the search away from this known structure and towards novel, interesting structures. We describe and formally define the task of non-redundant clustering. Three different algorithmic approaches are derived for non-redundant clustering. Their performance is experimentally evaluated on data sets containing multiple clusterings. We explore how these techniques may be extended to systematically enumerate clusterings in a data set. Finally, we also investigate whether non-redundant approaches may be incorporated to enhance state-of-the-art supervised techniques.
590 $a School code: 0024.
650 4 $a Computer Science. $3 1000005419
690 $a 0984
710 2 0 $a Brown University. $3 1000005774
773 0 $t Dissertation Abstracts International $g 66-05B.
790 1 0 $a Hofmann, Thomas, $e advisor
790 $a 0024
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3174612 $z