A Graph-Based Biomedical Literature Clustering Approach Utilizing Term's Global and Local Importance Information

A Graph-Based Biomedical Literature Clustering Approach Utilizing Term's Global and Local Importance Information

Xiaodan Zhang (Drexel University, USA), Xiaohua Hu (Drexel University, USA and Jiangxi University of Finance and Economics, China), Jiali Xia (Jiangxi University of Finance and Economics, China), Xiaohua Zhou (Drexel University, USA) and Palakorn Achananuparp (Drexel University, USA)
Copyright: © 2008 |Pages: 18
DOI: 10.4018/jdwm.2008100105
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In this article, we present a graph-based knowledge representation for biomedical digital library literature clustering. An efficient clustering method is developed to identify the ontology-enriched k-highest density term subgraphs that capture the core semantic relationship information about each document cluster. The distance between each document and the k term graph clusters is calculated. A document is then assigned to the closest term cluster. The extensive experimental results on two PubMed document sets (Disease10 and OHSUMED23) show that our approach is comparable to spherical k-means. The contributions of our approach are the following: (1) we provide two corpus-level graph representations to improve document clustering, a term co-occurrence graph and an abstract-title graph; (2) we develop an efficient and effective document clustering algorithm by identifying k distinguishable class-specific core term subgraphs using terms’ global and local importance information; and (3) the identified term clusters give a meaningful explanation for the document clustering results.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing