Concept Based Lattice Mining (CBLM) Using Formal Concept Analysis (FCA) for Text Mining

Extracting relevant resources according to a query is imperative due to the factors of time and accuracy. This study proposes a model that enables query matching using output lattices from Formal Concept Analysis (FCA) tool, based on Graph Theory. The deployment of FCA concept lattices ensures that the matching is done based on extracted concepts; not just mere keywords matching hence producing more relevant results. The focus of this study is on the method of Concept Based Lattice Mining (CBLM) where similarities among output lattices will be compared using their normalized adjacency matrices, utilizing a distance measure technique. The corresponding trace values obtained determines the degree of similarities among the lattices. An algorithm for CBLM is proposed and preliminary experimentation demonstrated promising results where lattices that are more similar have smaller trace values while higher trace values indicates greater dissimilarities among the lattices.

[1]  Kaspar Riesen,et al.  A Novel Software Toolkit for Graph Edit Distance Computation , 2013, GbRPR.

[2]  Gurpreet Singh Lehal,et al.  A Survey of Text Mining Techniques and Applications , 2009 .

[3]  Liang-Jie Zhang,et al.  Development of Distance Measures for Process Mining, Discovery and Integration , 2007, Int. J. Web Serv. Res..

[4]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[5]  S. Vetrivel,et al.  APPLICATIONS OF GRAPH THEORY IN COMPUTER SCIENCE AN OVERVIEW , 2010 .

[6]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[7]  D. West Introduction to Graph Theory , 1995 .

[8]  Balakrishnan Chandrasekaran,et al.  What are ontologies, and why do we need them? , 1999, IEEE Intell. Syst..

[9]  Ralph Bergmann,et al.  Similarity assessment and efficient retrieval of semantic workflows , 2014, Inf. Syst..

[10]  Martin Hepp,et al.  Possible Ontologies: How Reality Constrains the Development of Relevant Ontologies , 2007, IEEE Internet Computing.

[11]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[12]  Peter W. Eklund,et al.  A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing , 2010, ICFCA.

[13]  Khidir M. Ali,et al.  Applications of Graph Theory in Computer Science , 2011, 2011 Third International Conference on Computational Intelligence, Communication Systems and Networks.

[14]  Periklis Andritsos,et al.  Overview and semantic issues of text mining , 2007, SGMD.

[15]  John R. Josephson,et al.  What Are They? Why Do We Need Them? , 1999 .