Deriving Tree-Structured Network Relations in Bibliographic Databases

• Published in: Asian Digital Libraries Vol. 4822; pp. 504 - 505
• Main Authors: Kongthon, Alisa, Angkawattanawit, Niran
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2007; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: association rule mining; bibliographic databases; research and development management; text mining; Tree-structured networks
• ISBN: 9783540770930; 3540770933
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-77094-7_68

This paper presents a new algorithm called “tree-structured networks” that can automatically construct parent-child (hierarchical structure) and sibling relationships (non-hierarchical structure) among concepts from a set of documents without use of data reduction or standard clustering techniques. The algorithm is applied to bibliographic databases such as INSPEC and EI Compendex toward the objective of enhancing research and development (R&D) management. Deriving tree-structured networks of research topics is an important goal in R&D management study. Parent-child relationships can help identify emerging areas in an existing field of research. Sibling relationships are interesting as well since they could represent interdisciplinary structures among related topical areas. Based on the initial testing on a set of publication abstracts, the proposed algorithm promises to offer richer structural information on relationships in text sources over the standard clustering techniques.