A ConceptLink graph for text structure mining

Rowena Chau, Ah Chung Tsoi, Markus Hagenbuchner, Vincent Lee

Research output: Contribution to conferenceConference paper

9 Downloads (Pure)


Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector representing the occurrence of independent words in the text corpus. It is well known that using this vector-based representation, important information, such as semantic relationship among concepts, is lost. This paper proposes a novel text representation model called ConceptLink graph. The ConceptLink graph does not only represent the content of the document, but also captures some of its underlying semantic structure in terms of the relationships among concepts. The ConceptLink graph is constructed in two main stages. First, we find a set of concepts by clustering conceptually related terms using the self-organizing map method. Secondly, by mapping each document’s content to concept, we generate a graph of concepts based on the occurrences of concepts using a singular value decomposition technique. The ConceptLink graph will overcome the keyword independence limitation in the vector space model to take advantage of the implicit concept relationships exhibit in all natural language texts. As an information-rich text representation model, the ConceptLink graph will advance text mining technology beyond feature-based to structure-based knowledge discovery. We will illustrate the ConceptLink graph method using samples generated from benchmark text mining dataset.

Original languageEnglish
Publication statusPublished - 2009
Externally publishedYes
EventAustralsian Computer Science Conference (ACSC 2009) - Wellington, New Zealand
Duration: 19 Jan 200923 Jan 2009


ConferenceAustralsian Computer Science Conference (ACSC 2009)


Dive into the research topics of 'A ConceptLink graph for text structure mining'. Together they form a unique fingerprint.

Cite this