Deakin home > Deakin University Library > Deakin Research Online > The density connectivity information bottleneck

The density connectivity information bottleneck

Ren, Yongli, Ye, Yangdong and Li, Gang 2008, The density connectivity information bottleneck, in Proceedings of the 9th International Conference for Young Computer Scientists, IEEE Computer Society, Piscataway, N.J., pp. 1783-1788.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title The density connectivity information bottleneck
Author(s) Ren, Yongli
Ye, Yangdong
Li, Gang
Conference name International Conference for Young Computer Scientists (9th : 2008 : Zhang Jie Jie, China)
Conference location Zhang Jia Jie, China
Conference dates 18-21 November 2008
Title of proceedings Proceedings of the 9th International Conference for Young Computer Scientists
Editor(s) Wang, Guojun
Chen, Jianer
Fellows, Michael R.
Ma, Huadong
Publication date 2008
Conference series International Conference for Young Computer Scientists
Start page 1783
End page 1788
Publisher IEEE Computer Society
Place of publication Piscataway, N.J.
Keyword(s) the aIB algorithm
density connectivity
clustering tree-structure
Summary Clustering with the agglomerative Information Bottleneck (aIB) algorithm suffers from the sub-optimality problem, which cannot guarantee to preserve as much relative information as possible. To handle this problem, we introduce a density connectivity chain, by which we consider not only the information between two data elements, but also the information among the neighbors of a data element. Based on this idea, we propose DCIB, a Density Connectivity Information Bottleneck algorithm that applies the Information Bottleneck method to quantify the relative information during the clustering procedure. As a hierarchical algorithm, the DCIB algorithm produces a pruned clustering tree-structure and gets clustering results in different sizes in a single execution. The experiment results in the documentation clustering indicate that the DCIB algorithm can preserve more relative information and achieve higher precision than the aIB algorithm.
ISBN 9780769533988
Language eng
Field of Research 080107 Natural Language Processing
HERDC Research category E1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30018140

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 315 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Fri, 14 Aug 2009, 14:05:16 EST