Advertisement

Discovering Compatible Top-K Theme Patterns from Text Based on Users’ Preferences

  • Yongxin Tong
  • Shilong Ma
  • Dan Yu
  • Yuanyuan Zhang
  • Li Zhao
  • Ke Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5477)

Abstract

Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and information retrieval. Recent studies of theme pattern mining have paid close attention to the problem of discovering a set of compatible top-k theme patterns with both high-interestingness and low-redundancy. Since different users have different preferences on interestingness and redundancy, how to measure the attributes of the users’ preferences, and thereby to discover “preferred compatible top-k theme patterns” (PCTTP) is urgent in the field of text mining. In this paper, a novel strategy of discovering PCTTP based on users’ preferences in text mining is proposed. Firstly, an evaluation function of the preferred compatibility between every two theme patterns is presented. Then the preferred compatibilities are archived into a data structure called theme compatibility graph, and a problem called MWSP based on the compatibility graph is proposed to formulate the problem how to discover the PCTTP. Secondly, since MWSP is proved to be a NP-Hard problem, a greedy algorithm, DPCTG, is designed to approximate the optimal solution of MWSP. Thirdly, a quality evaluation model is introduced to measure the compatibility of discovering theme patterns. Empirical studies indicate that a high quality set of PCTTP on four different sub text sets can be obtained from DBLP.

Keywords

Approximation Ratio Frequent Pattern Jaccard Distance Compatibility Graph Text Dataset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Afrati, F.N., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: KDD 2004, pp. 8–19 (2004)Google Scholar
  2. 2.
    Krovetz, R.: Viewing morphology as an inference process. In: Proceedings of SIGIR 1993, pp. 191–202 (1993)Google Scholar
  3. 3.
    Mei, Q., Xin, D., Cheng, H., Han, J., Zhai, C.: Generating semantic annotations for frequent patterns with context analysis. In: KDD 2006, pp. 337–346 (2006)Google Scholar
  4. 4.
    Mei, Q., Xin, D., Cheng, H., Han, J., Zhai, C.: Discovering Evolutionary Theme semantic annotations for frequent patterns with context analysis. In: KDD 2005 (2005)Google Scholar
  5. 5.
    Tzvetkov, P., Yan, X., Han, J.: TSP: Mining top-k closed sequential patterns. Knowledge and Information Systems 7, 438–457 (2005)CrossRefGoogle Scholar
  6. 6.
    Varian, H.: Intermediate Microeconomics: A Modern Approach, 6th edn. W.W. Norton & Company Inc. (2003)Google Scholar
  7. 7.
    Xin, D., Han, J., Yan, X., Cheng, H.: On compressing frequent patterns. In: KIS 2007 (2007)Google Scholar
  8. 8.
    Xin, D., Han, J., Yan, X., Cheng, H.: Discovering Redundancy-Aware Top-K Patterns. In: KDD 2006, pp. 314–323 (2006)Google Scholar
  9. 9.
    Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing Itemset Patterns: A Profile Based Approach. In: KDD 2005, pp. 314–323 (2005)Google Scholar
  10. 10.
    Yan, X., Han, J., Afshar, R.: Clospan: Mining closed sequential patterns in large datasets. In: SDM 2003, pp. 166–177 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yongxin Tong
    • 1
  • Shilong Ma
    • 1
  • Dan Yu
    • 1
  • Yuanyuan Zhang
    • 2
  • Li Zhao
    • 1
  • Ke Xu
    • 1
  1. 1.State Key Lab. of Software Development EnvironmentBeihang UniversityBeijingChina
  2. 2.China Academy of Telecommunication TechnologyBeijingChina

Personalised recommendations