Openly accessible

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
Name Description MIMEType Size Downloads
li-densityconnectivity-2008.pdf Published version application/pdf 505.25KB 1

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
Total pages 6
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.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 9780769533988
Language eng
Field of Research 080107 Natural Language Processing
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2008, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30018140

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

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

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

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.