Acquiring Word Similarities with Higher Order Association Mining

  • Authors:
  • Sutanu Chakraborti;Nirmalie Wiratunga;Robert Lothian;Stuart Watt

  • Affiliations:
  • School of Computing, The Robert Gordon University, Aberdeen AB25 1HG, Scotland, UK;School of Computing, The Robert Gordon University, Aberdeen AB25 1HG, Scotland, UK;School of Computing, The Robert Gordon University, Aberdeen AB25 1HG, Scotland, UK;School of Computing, The Robert Gordon University, Aberdeen AB25 1HG, Scotland, UK

  • Venue:
  • ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel approach to mine word similarity in Textual Case Based Reasoning. We exploit indirect associations of words, in addition to direct ones for estimating their similarity. If word Aco-occurs with word B, we say Aand Bshare a first order association between them. If Aco-occurs with Bin some documents, and Bwith Cin some others, then Aand Care said to share a second order co-occurrence via B. Higher orders of co-occurrence may similarly be defined. In this paper we present algorithms for mining higher order co-occurrences. A weighted linear model is used to combine the contribution of these higher orders into a word similarity model. Our experimental results demonstrate significant improvements compared to similarity models based on first order co-occurrences alone. Our approach also outperforms state-of-the-art techniques like SVM and LSI in classification tasks of varying complexity.