Academia.eduAcademia.edu

Outline

Title
Abstract
Chapter 2 Background and Literature Review
The Study of Language
Different Levels of Language Analysis
Concept-Based Statistical Analyzer
Sentence-Based Concept Analysis
Document-Based Concept Analysis
Corpus-Based Concept Analysis
Example: Concept-Based Statistical Analyzer
Chapter 4 Experimental Results
Overview
Discussion
Text Clustering Results
Text Categorization Results
Text Retrieval Results
Observations and Conclusions
Summary
Limitation of the Approach
Future Work
2 Text Categorization Results
References
All Topics
Computer Science
Natural Language Processing

Concept Mining: A Conceptual Understanding based Approach

Profile image of Shady ShehataShady Shehata

2009

Abstract

This thesis would not be possible without the support of many individuals, to whom I would like to express my gratitude. I will always be indebted to my supervisors, Prof. Fakhri Karray and Prof. Mohamed Kamel, for their support, encouragement, guidance, and most importantly trust. Prof. Karray's trust and support was instrumental in giving me confidence to achieve many accomplishments. I would like to thank Prof. Karray for his encouragement and guidance throughout my research. Prof. Kamel's input and guidance was invaluable to the quality and contribution of the work presented in this thesis, as well as in other publications. I would like to thank Prof. Kamel for his advice, valuable insights and feedback throughout my research. Without them this research would not have been possible. I would like also to thank many faculty members of the University of Waterloo, most notably my committee members, Prof. Chrysanne DiMarco, Prof. Krzysztof Czarnecki and Prof. Kostas Kontogiannis for their valuable input and suggestions.

Related papers

Concept-based knowledge discovery in texts extracted from the web
Leandro Krug Wives

Sigkdd Explorations, 2000

This paper presents an approach for knowledge discovery in texts extracted from the Web. Instead of analyzing words or attribute values, the approach is based on concepts, which are extracted from texts to be used as characteristics in the mining process. Statistical techniques are applied on concepts in order to find interesting patterns in concept distributions or associations. In this way, users can perform discovery in a high level, since concepts describe real world events, objects, thoughts, etc. For identifying concepts in texts, a categorization algorithm is used associated to a previous classification task for concept definitions. Two experiments are presented: one for political analysis and other for competitive intelligence. At the end, the approach is discussed, examining its problems and advantages in the Web context.

View PDFchevron_right
Pattern Structures and Concept Lattices for Data Mining and Knowledge Processing
Aleksey Buzmakov

Lecture Notes in Computer Science, 2015

This article aims at presenting recent advances in Formal Concept Analysis (2010-2015), especially when the question is dealing with complex data (numbers, graphs, sequences, etc.) in domains such as databases (functional dependencies), data-mining (local pattern discovery), information retrieval and information fusion. As these advances are mainly published in artificial intelligence and FCA dedicated venues, a dissemination towards data mining and machine learning is worthwhile.

View PDFchevron_right
Concept-Based Mining Model
Shady Shehata

Innovations and Systemic Approaches

Due to the daily rapid growth of the information, there are considerable needs in extracting and discovering valuable knowledge from the vast amount of information found in different data sources today such

View PDFchevron_right
CoFiH: A heuristic for concept discovery in computer- assisted conceptual analysis
Louis Chartrand

While conceptual analysis can be facilitated by computer assistance, the absence of proper models for concepts in text has curtailed the development of such tools. The most common heuristic, which consists in identifying keywords as canonical expression of a concept, poses problems of ambiguity and fails to retrieve most of the relevant textual data. In this paper, we present CoFiH, an algorithm that exploits topics in order to retrieve segments relevant to a given concept. It is then applied to C.S. Peirce's Collected Papers to facilitate the analysis of Peirce's concept of LAW. Compared to the baseline, CoFiH produces better recall and enables a meaningful analysis along several topics.

View PDFchevron_right
Concept Relation Discovery and Innovation Enabling Technology (Cordiet)
Alexey Neznanov

SSRN Electronic Journal, 2010

Concept discovery is a Knowledge Discovery in Databases (KDD) research field that uses human-centered techniques such as Formal Concept Analysis (FCA), Biclustering, Triclustering, Conceptual Graphs etc. for gaining insight into the underlying conceptual structure of the data. Traditional machine learning techniques are mainly focusing on structured data whereas most data available resides in unstructured, often textual, form. Compared to traditional data mining techniques, human-centered instruments actively engage the domain expert in the discovery process. This volume contains the contributions to CDUD 2011, the International Workshop on Concept Discovery in Unstructured Data (CDUD) held in Moscow. The main goal of this workshop was to provide a forum for researchers and developers of data mining instruments working on issues with analyzing unstructured data. We are proud that we could welcome 13 valuable contributions to this volume. The majority of the accepted papers described innovative research on data discovery in unstructured texts. Authors worked on issues such as transforming unstructured into structured information by amongst others extracting keywords and opinion words from texts with Natural Language Processing methods. Multiple authors who participated in the workshop used methods from the conceptual structures field including Formal Concept Analysis and Conceptual Graphs. Applications include but are not limited to text mining police reports, sociological definitions, movie reviews, etc. Last but not least, we would like to thank the administration of the Higher School of Economics who took care of all arrangements to make this conference pleasant and enjoyable.

View PDFchevron_right
A Parameterized Algorithm for Exploring Concept Lattices
Sébastien Ferré, O. Ridoux

Lecture Notes in Computer Science, 2007

Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (respectively negative examples) are sets of frequent concepts with respect to a minimal support, whose extent contains only positive examples (respectively negative examples).

View PDFchevron_right
Formal Concept Analysis in Knowledge Discovery: A Survey
Jonas Poelmans

Lecture Notes in Computer Science, 2010

In this paper, we analyze the literature on Formal Concept Analysis (FCA) using FCA. We collected 702 papers published between 2003-2009 mentioning Formal Concept Analysis in the abstract. We developed a knowledge browsing environment to support our literature analysis process. The pdf-files containing the papers were converted to plain text and indexed by Lucene using a thesaurus containing terms related to FCA research. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. As a case study, we zoom in on the 140 papers on using FCA in knowledge discovery and data mining and give an extensive overview of the contents of this literature.

View PDFchevron_right
APACS: a system for the automatic analysis and classification of conceptual patterns
Andrew Wong

Computational Intelligence, 1990

Many existing inductive learning systems have been developed under the assumption that the learning tasks are performed in a noise-free environment. To cope with most real-world problems, it is important that a learning system be equipped with the capability to handle uncertainty. In this paper, we first identify the various sources of uncertainty that may be encountered in a noisy problem domain. Next, we present a method for the efficient acquisition of classification rules from training instances which may contain inconsistent, incorrect, or missing information. This algorithm consists of three phases: (i) the detection of inherent patterns in a set of noisy training data; (ii) the construction of classification rules based on these patterns; and (iii) the use of these rules to predict the class membership of an object. The method has been implemented in a system known as APACS (automatic pattern analysis and classification system). This system has been tested using both real-life and simulated data, and its performance is found to be superior to many existing systems in terms of efficiency and classification accuracy. Being able to handle uncertainty in the learning process, the proposed algorithm can be employed for applications in real-world problem domains involving noisy data.De nombreux systèmes ?apprentissage inductif existants ont étéélaborés suivant le principe que les tǎches ?appren-tissage sont exécutées dans un environnement sans bruit. Afin de faire face a la plupart des problèmes du monde réel, il est important que le système ?apprentissage soit en mesure de tenir compte de ľincertitude. Dans cet article, les auteurs identifient les diverses sources ?incertitude qui peuvent ětre rencontrées dans un domaine bruité. Par la suite, ils proposent une méthode de saisie efficace de régies de classification pour des situations ?apprentissage pouvant comporter des informations incorrectes, incomplétes ou incohérentes. Ľalgorithme comporte trois phases: (i) la détection de formes inhérentes dans un ensemble de données ?apprentissage bruitées; (ii) ľélaboration de régies de classification basées sur ces formes; (iii) ľutilisation de ces règies pour prédire ľappartenance ?un objet à une classe. La méthode a été mise en oeuvre dans un système appelé APACS (automatic pattern analysis and classification system). Ce système a été soumis à des essais en utilisant des données réelles et des données simulées; sa performance s'est avérée supérieure à celle de nombreux systèmes existants en termes ?efficacité et de précision. Puisqu'il est en mesure de tenir compte de ľincertitude dans le processus ?apprentissage, ľalgorithme proposé peut ětre applique a la resolution de problèmes du monde réel qui mettent en cause des données bruitées.Mots clés: classification, données ?apprentissage bruitées, formes probabilistiques, régies probabilistiques, couplage partiel, poids de ľévidence, information mutuelle.

View PDFchevron_right
A Survey of Conceptual Data Mining and Applications
Journal of Computer Science IJCSIS

Data mining may be a process of distinguishing and extracting hidden patterns and knowledge from databases and data warehouses. It is also referred to as knowledge Discovery in Databases (KDD) and permits knowledge discovery, data analysis, and data visualization of large databases at a high level of abstraction, while not a selected premise in mind. The operation of data mining is known by employing a technique known as modeling with it to create predictions. There are various algorithms and tools on the market for this purpose. Data mining encompasses a large variety of applications ranging from business to medication to engineering. This paper provides a survey of data mining technology, its models, and task, applications, major problems, and directions for advance analysis of data mining applications. https://sites.google.com/site/ijcsis/vol-11-no-5-may-2013

View PDFchevron_right
Discovering Knowledge in Data Using Formal Concept Analysis
Constantinos Orphanides

International Journal of Distributed Systems and Technologies, 2013

Formal Concept Analysis (FCA) has been successfully applied to data in a number of problem domains. However, its use has tended to be on an ad hoc, bespoke basis, relying on FCA experts working closely with domain experts and requiring the production of specialised FCA software for the data analysis. The availability of generalised tools and techniques, that might allow FCA to be applied to data more widely, is limited. Two important issues provide barriers: raw data is not normally in a form suitable for FCA and requires undergoing a process of transformation to make it suitable, and even when converted into a suitable form for FCA, real data sets tend to produce a large number of results that can be difficult to manage and interpret. This article describes how some open-source tools and techniques have been developed and used to address these issues and make FCA more widely available and applicable. Three examples of real data sets, and real problems related to them, are used to i...

View PDFchevron_right

References (126)

  1. A Vector Space with Two Dimensions . . . . . . . . . . . . . . . . . . . . . . . . . .
  2. 1 Concept-based Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  3. 2 Conceptual Ontological Graph (COG) Representation . . . . . . . . . . . . . . . . .
  4. 1 Concept-based Model For Text Clustering . . . . . . . . . . . . . . . . . . . . . . .
  5. 2 Clustering Improvements (F-Measure) . . . . . . . . . . . . . . . . . . . . . . . . .
  6. 3 Clustering Improvements (Entropy) . . . . . . . . . . . . . . . . . . . . . . . . . . .
  7. 4 Clustering Range of Improvements (F-Measure) . . . . . . . . . . . . . . . . . . . .
  8. 5 Clustering Range of Improvements (Entropy) . . . . . . . . . . . . . . . . . . . . . .
  9. 6 Concept-based Model For Text Categorization . . . . . . . . . . . . . . . . . . . . .
  10. 7 Categorization Improvements (F-Micro) . . . . . . . . . . . . . . . . . . . . . . . .
  11. 8 Categorization Improvements (F-Macro) . . . . . . . . . . . . . . . . . . . . . . . .
  12. 9 Categorization Improvements (Error) . . . . . . . . . . . . . . . . . . . . . . . . . .
  13. 10 Categorization Range of Improvements (F-Micro) . . . . . . . . . . . . . . . . . . .
  14. 11 Categorization Range of Improvements (F-Macro) . . . . . . . . . . . . . . . . . . .
  15. 12 Categorization Range of Improvements (Error) . . . . . . . . . . . . . . . . . . . . .
  16. 13 Concept-based Model For Text Retrieval . . . . . . . . . . . . . . . . . . . . . . . .
  17. 14 Retrieval Improvements (bpref) . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  18. 15 Retrieval Improvements (P10) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  19. 16 Retrieval Improvements (MAP) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi
  20. 17 Retrieval Range of Improvements (bpref) . . . . . . . . . . . . . . . . . . . . . . . .
  21. 18 Retrieval Range of Improvements (P10) . . . . . . . . . . . . . . . . . . . . . . . . .
  22. 19 Retrieval Range of Improvements (MAP) . . . . . . . . . . . . . . . . . . . . . . . .
  23. 20 Standard Deviation (F-Measure) . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  24. 21 Standard Deviation (Entropy) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  25. 22 Standard Deviation (F-Macro) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  26. 23 Standard Deviation (F-Micro) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  27. 24 Standard Deviation (Error) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  28. 25 Standard Deviation (bpref) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  29. 26 Standard Deviation (P10) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  30. 27 Standard Deviation (MAP) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  31. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Concept-based Mining Model", Dynamic and Advanced Data Mining for Progressing Technological Development: Innovations and Systemic Approaches, by IGI Publishing (formerly called "Idea Group Publishing"), IRM Press, Information Science Publishing, CyberTech Publishing, and Information Science Ref- erence. 2007.
  32. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Concept-based Text Clustering", Evolv- ing Application Domains of Data Warehousing and Mining: Trends and Solutions, by IGI Publishing (formerly called "Idea Group Publishing"), IRM Press, Information Science Pub- lishing, CyberTech Publishing, and Information Science Reference. 2007. Journal Articles -Submitted
  33. Shady Shehata, Fakhri Karray, Mohamed Kamel, "An Efficient Concept-based Mining Model for Enhancing Text Clustering", IEEE Transactions on Knowledge and Data Engineering (TKDE).
  34. Shady Shehata, Fakhri Karray, Mohamed Kamel, "An Efficient Model For Enhancing Text Classification Using Sentence Semantics", Special Issue of Computational Intelligence Jour- nal. (ADMA08 paper has been selected)
  35. Shady Shehata, Fakhri Karray, Mohamed Kamel, "An Efficient Concept-based Method for Semantic Text Analysis", Computational Linguistics Journal.
  36. Shady Shehata, Fakhri Karray, Mohamed Kamel, "An Efficient Concept-based Retrieval Model For Enhancing Search Engine Quality", Knowledge and Information Systems Journal (KAIS). Journal Articles -In Preparation
  37. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Text Categorization Using Concept-based Model", ACM Transactions on Knowledge Discovery From Data (TKDD). Conference Proceedings
  38. Shady Shehata, Fakhri Karray, Mohamed Kamel, "A Concept-based Model for Enhancing Text Categorization", 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), USA 2007, pp. 629-637. [Full paper in research track with acceptance rate: less than 8%]
  39. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Text Clustering Using Concept- based Mining Model", IEEE International Conference on Data Mining (ICDM), Hong Kong 2006, pp. 1043-1048. [Full paper in research track with acceptance rate: less than 10%]
  40. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Search Engine Quality Using Concept-based Text Retrieval", IEEE/WIC/ACM International Conference on Web Intelli- gence (WI), USA 2007, pp. 26-32. [Acceptance rate: 17%]
  41. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Text Classification Using Sen- tence Semantics", Advanced Data Mining and Applications (ADMA), 2008, pp. 87-98. [Acceptance rate: 26%] Best Paper Award Nomination
  42. Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Text Retrieval Performance Using Conceptual Ontological Graph", Workshop on Ontology Mining and Knowledge Dis- covery from Semi-Structured Documents (MSD), IEEE International Conference on Data Mining, ICDM, Hong Kong 2006, pp. 39-44. [Acceptance rate: 30%]
  43. Shady Shehata, Fakhri Karray, Mohamed Kamel, "A Concept-based Graph Representation for Enhancing Text Categorization", Text Mining Workshop (TMW09), SIAM International Conference on Data Mining (SDM), 2009.
  44. Shady H. Shehata, Fakhri Karray, Mohamed Kamel, "Concept-based Mining Model for Learning Objects", LORNET Scientific Conference on Learning Systems of the Future: In- tegrating Knowledge and Services (I2LOR06), Montreal, Canada 2006.
  45. Christopher Brooks, Scott Bateman, Wengang Liu, Gordon McCalla, Jim Greer, Dragan Gaevic, Timmy Eap, Griff Richards, Khaled Hammouda, Shady H. Shehata, Mohamed Kamel, Fakhri Karray, Jelena Jovanovic, "Issues and Directions with Educational Metadata", LORNET Scientific Conference on Learning Systems of the Future: Integrating Knowledge and Services (I2LOR06), Montreal, Canada 2006.
  46. Shady H. Shehata, Fakhri Karray, Mohamed Kamel, "Concept Mining using Conceptual Ontological Graph (COG)", LORNET Scientific Conference on Portals and Services for Knowledge Management and Learning on the Semantic Web (I2LOR05), Montreal, Canada 2005.
  47. Shady H. Shehata, Fakhri Karray, Mohamed Kamel, Anas Vaqar and Hazem Shehata. "A Framework for Ontology Construction from Text Documents", International Conference of e-Learning Applications, 2005.
  48. Shady H. Shehata, Jan Bakus, Fakhri Karray and Mohamed Kamel, "The Effect of Verb Argument Structure on Document Classification", International Conference in Machine In- telligence (ACIDCA-ICMI), 2005.
  49. Yu Sun, Fakhri Karray, Shady H. Shehata, Otman Basir, Mohamed Kamel and Jiping Sun, "Measures of Fuzzy Event for Determination of Semantic Meaning", International Conference in Machine Intelligence (ACIDCA-ICMI), 2005.
  50. Shady H. Shehata, Fakhri Karray, Mohamed Kamel, "Multi-Agent Framework for Enhanc- ing Ontology based on Fuzzy Inferencing", LORNET Scientific Conference on Towards the Educational Semantic Web (I2LOR -04), Montreal, Canada, November 18th and 19th, 2004.
  51. Posters • Shady Shehata, Fakhri Karray, Mohamed Kamel, "Enhancing Text Categorization, Retrieval and Clustering Using Concept-based Model", 4th annual LORNET Scientific Conference I2LOR-07 in Montreal (Nov 4-7), 2007. First Position Award For Best Poster Bibliography
  52. M. Lynch, "e-business analytics, Indepth Report," 20 November 2000.
  53. T. Berners-Lee, J. Hendler, and O. Lassila, "The semantic web." Scientific American, 2001.
  54. R. Feldman and I. Dagan, "Knowledge discovery in textual databases (kdt)," in First Interna- tional Conference on Knowledge Discovery and Data Mining (KDD-95), Montreal, Canada, 1995, pp. 112-117.
  55. G. Salton, A. Wong, and C. Yang, "A vector space model for automatic indexing," Commu- nications of the ACM, vol. 18, no. 11, pp. 613-620, November 1975.
  56. C. Manning. and H. Schutze, Foundations of Statistical Natural Language Processing. MIT Press, 1999.
  57. C. Y. Suen, "N-gram statistics for natural language understanding and text processing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 164-172, April 1979.
  58. M. F. Porter, "An algorithm for suffix stripping," Program, vol. 14, no. 3, pp. 130-137, July 1975.
  59. M. Steinbach, G. Karypis, and V. Kumar, "Scatter/gather:a cluster-based approach to brows- ing large document collections," in 16th International ACM SIGIR Conference on Research and Development in Information Retrieval, 1993.
  60. --, "A comparison of document clustering techniques," in Knowledge Discovery and Data Mining (KDD) Workshop on TextMining, August 2000.
  61. K. Cios, W. Pedrycs, and R. Swiniarski, "Data mining methods for knowledge discovery." Boston: Kluwer Academic Publishers, 1998.
  62. C. J. van Rijsbergen, Information Retrieval. London, second edition.: Buttersworth, 1979.
  63. G. Kowalski, Information Retrieval Systems Theory and Implementation. Kluwer Academic Publishers, 1997.
  64. C. Buckley and A. F. Lewit, "Optimization of inverted vector searches," in SIGIR, 1985, pp. 97-110.
  65. D. R. Cutting, J. O. Pedersen, D. Karger, and J. W. Tukey, "Scatter/gather: A cluster-based approach to browsing large document collections," in Proceedings of the Fifteenth Annual In- ternational ACM SIGIR Conference on Research and Development in Information Retrieval, 1992, pp. 318-329.
  66. O. Zamir, O. Etzioni, O. Madani, and R. M. Karp, "Fast and intuitive clustering of web documents," in KDD, 1997, pp. 287-290.
  67. D. Koller and M. Sahami, "Hierarchically classifying documents using very few words," in ICML, D. H. Fisher, Ed. Morgan Kaufmann, 1997, pp. 170-178.
  68. C. Aggarwal, S. Gates, and P. Yu, "On the merits of bilding categorization systems by su- pervised clustering," in Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, S. Chaudhuri and D. Madigan, Eds. N.Y.: ACM Press, Aug. 15-18 1999, pp. 352-356.
  69. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Englewood Cliffs: Prentice Hall, 1988.
  70. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Anal- ysis, ser. Wiley Series in Probability and Mathematical Statistics. New York: John Wiley & Sons Inc., 1990.
  71. K. J. Cios, W. Pedrycz, and R. W. Swiniarski, "Data mining methods for knowledge discov- ery," IEEE Transactions on Neural Networks, vol. 9, no. 6, pp. 1533-1534, 1998.
  72. B. V. Dasarathy, Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, 1991.
  73. D. R. Hill, "A vector clustering technique," in FID-IFIP , Samuelson(ed), N-H 1968, 1967.
  74. C. E. Shannon, "A mathematical theory of communication," Bell Systems Technical Journal, vol. 27, no. 3, pp. 379-423, July 1948, continued 27(4):623-656, October 1948.
  75. B. Larsen and C. Aone, "Fast and effective text mining using linear-time document clustering," in KDD, 1999, pp. 16-22.
  76. Z. Xu, X. Xu, K. Yu, and V. Tresp, "A hybrid relevance-feedback approach to text retrieval," in ECIR, ser. Lecture Notes in Computer Science, F. Sebastiani, Ed., vol. 2633. Springer, 2003, pp. 281-293.
  77. P. R. Halmos, Naive Set Theory. New York: Springer, 1974.
  78. J. E. Goin, "Classification bias of the K-nearest neighbor algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 379-381, May 1984.
  79. V. Vapnik, Statistical Learning Theory. Wiley, 1998.
  80. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines. Cambridge University Press, 2000.
  81. A. F. Smeaton, "An overview of information retrieval," in Information Retrieval and Hyper- text, M. Agosti and A. F. Smeaton, Eds. Dordrecht, NL: Kluwer Academic Publishers, 1997, pp. 3-25.
  82. S. Robertson, S. Walker, and M. Beaulieu, "Okapi at trec-7: Automatic ad hoc, filtering, vlc and interactive track."
  83. S. E. Robertson, S. Walker, M. Hancock-Beaulieu, A. Gull, and M. Lau, "Okapi at TREC," in Text REtrieval Conference, 1992, pp. 21-30.
  84. D. Hull, "Using statistical testing in the evaluation of retrieval experiments," in Proceedings of Special Interest Group on Information Retrieval (ACM SIGIR), 1993.
  85. C. Buckley and E. M. Voorhees, "Retrieval evaluation with incomplete information," in SIGIR '04: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval. New York, NY, USA: ACM Press, 2004, pp. 25-32. [Online]. Available: http://portal.acm.org/citation.cfm?id=1009000
  86. J. F. Allen, Natural Language Understanding, second edition ed. Redwood City: CA: Ben- jamin/Cummings, 1994.
  87. D. Jurafsky and J. H. Martin, Speech and Language Processing. Prentice Hall Inc., 2000.
  88. C. Fillmore, "The case for case," in Universals in Linguistic Theory, E. Bach and R. Harms, Eds. Holt and Rinehart and Winston, 1968, pp. 1-88.
  89. L. Levin, "Operations on lexical forms: Unaccusative rules in germanic languages," Ph.D. dissertation, MIT and Department of Linguistics and Philosophy, 1985b.
  90. L. Beth, English Verb Classes and Alternations A Preliminary Investigation. The University of Chicago Press, 1993.
  91. C. F. Baker, C. J. Fillmore, and J. B. Lowe, "The berkeley framenet project," in Proceedings of the 1998 COLING-ACL Conference, Montreal, Canada, 1998, pp. 86-90.
  92. K. Paul and P. Martha, "From treebank to propbank," in Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC-2002), Spain, 2002.
  93. P. Kingsbury, M. Palmer, and M. Marcus, "Adding semantic annotation to the penn tree- bank," in Proceedings of the Human Language Technology Conference (HLT'02), 2002.
  94. K. Kipper, H. Dang, and M. Palmer, "Class-based construction of a verb lexicon," in AAAI- 2000 Seventeenth National Conference on Artificial Intelligence, Austin, TX, 2000.
  95. P. Kingsbury and K. Kipper, "Deriving verb-meaning clusters from syntactic structure," in HLT/NAACL Workshop on Text Meaning, 2003.
  96. R. Al-Halimi, R. C. Berwick, J. F. M. Burg, M. Chodorow, C. Fellbaum, et al., WordNet: An Electronic Lexical Database, C. Fellbaum, Ed. Cambridge: MIT Press, 1998.
  97. D. Gildea and D. Jurafsky, "Automatic labeling of semantic roles," Computational Linguistics, vol. 28, no. 3, 2002.
  98. M. Collins, "Head-driven statistical model for natural language parsing," Ph.D. dissertation, University of Pennsylvania, 1999.
  99. S. Pradhan, W. Ward, K. Hacioglu, J. H. Martin, and D. Jurafsky, "Shallow semantic parsing using support vector machines," in the Proceedings of the Human Language Technology/North American Association for Computational Linguistics (HLT/NAACL-2004), Boston, 2004.
  100. M. Surdeanu, "Using predicate argument structures for information extraction," in ACL, Sapporo, Japan, 2003.
  101. E. Schapire, "The boosting approach to machine learning," in Proceedings of the MSRI Work- shop on Nonlinear Estimation and Classification, Berkeley, CA, 2002.
  102. A. Cynthia, R. Levy, and C. D. Manning, "A generative model for semantic role labeling," in European Conference on Machine Learning (ECML), 2003, pp. 397-408.
  103. K. Hacioglu, S. Pradhan, W. Ward, J. H. Martin, and D. Jurafsky, "Semantic role labeling by tagging syntactic chunks," in the Proceedings of the Eighth Conference on Natural Language Learning (CoNLL-2004), Boston, 2004.
  104. M. King, "Evaluating natural language processing systems," Commun. ACM, vol. 39, no. 1, pp. 73-79, 1996.
  105. J. F. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Founda- tions. Pacific Grove, CA: Brooks Cole Publishing Co., August 1999.
  106. T. R. Gruber, "A translation approach to portable ontologies," Journal of Knowledge Acqui- sition, vol. 5, no. 2, pp. 199-220, 1993.
  107. --, "Toward principles for the design of ontologies used for knowledge sharing," in workshop on Formal Ontology, March 1993.
  108. S. U. O. W. G. S. WG), OpenCyc Project, IEEE.
  109. G. Frank, A. Farquhar, R. Fikes, V. Heiberg, and S. Zamler, The World Fact Book Knowledge Base Project, Stanford University.
  110. NLM's Unified Medical Language Project, National Library of Medicine, 1999.
  111. D. Brickley and R. V. Guha, RDF Vocabulary Description Language 1.0: RDF Schema, World Wide Web Consortium (W3C) Recommendation, 2004.
  112. M. Paolucci, O. Shehory, and K. Sycara, "Interleaving planning and execution in a multiagent team planning environment," Electronic Transactions of Artificial Intelligence, 2001.
  113. D. Fensel, F. Harmelen, I. Horrocks, D. L. McGuinness, and P. F. Patel-Schneider, "Oil: An ontology infrastructure for the semantic web," IEEE Intelligent Systems, 2001.
  114. S. Bechhofer, C. Goble, and I. Horrocks, "Daml+oil is not enough," First Semantic Web Working Symposium (SWWS'01), 2001.
  115. M. Dean et al., OWL Web Ontology Language Reference, World Wide Web Consortium (W3C) Recommendation, 2003.
  116. M. Viezzer, "Ontologies and problem-solving methods and ontology learning," in European Conference on Artificial Intelligence (ECAI), August 2000.
  117. N. Houser, D. D. Roberts, and J. V. Evra, Studies in the Logic of Charles Sanders Peirce. Bloomington: Indiana University Press, 1997.
  118. M. Minsky, Semantic Information Processing. Cambridge, MA: MIT Press, 1968.
  119. P. Kingsbury and M. Palmer, "Propbank: the next level of treebank," in Proceedings of Treebanks and Lexical Theories, 2003.
  120. A. Strehl, J. Ghosh, and R. Mooney, "Impact of similarity measures on web-page clustering," in Proceedings of 17th National Conference on Artificial Intelligence: Workshop of Artificial Intelligence for Web Search (AAAI), 2000, pp. 58-64.
  121. W. Francis and H. Kucera, Manual of information to accompany a standard corpus of present- day edited american english, for use with digital computers, 1964.
  122. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, N.J., 1988.
  123. S. Y. Lu and K. S. Fu, "A sentence to sentence clustering procedure for pattern analysis," IEEE Transactions on Systems Mans and Cybernetics, vol. 8, pp. 381-389, 1978.
  124. "Apache jakarta lucene search engine (version 1.3), http://lucene.apache.org/."
  125. I. Ounis, G. Amati, V. Plachouras, B. He, C. Macdonald, and C. Lioma, "Terrier: A High Performance and Scalable Information Retrieval Platform," in Proceedings of ACM SIGIR'06 Workshop on Open Source Information Retrieval (OSIR 2006), 2006.
  126. T. Joachims, "Text categorization with support vector machines: learning with many rele- vant features," in Proceedings of ECML-98, 10th European Conference on Machine Learning, C. Nédellec and C. Rouveirol, Eds., no. 1398. Chemnitz, DE: Springer Verlag, Heidelberg, DE, 1998, pp. 137-142.

Related papers

Towards quantitative concept analysis
Rogelio Nazar

2007

In this paper we present an approach to the automatic extraction of conceptual structures from unorganized collections of documents using large scale lexical regularities in text. The technique maps a term to a constellation of other terms that captures the essential meaning of the term in question. The methodology is language independent, it involves an exploration of a document collection in which the initial term occurs (e.g., the collection returned by a search engine when being queried with this term) and the building of a network in which each node is assigned to a term. The weights of the connections between nodes are strengthened each time the terms that these nodes represent appear together in a context of a predefined length. Possible applications are automatic concept map generation, terminology extraction, term retrieval, term translation, term localization, etc. The system is currently under development although preliminary experiments show promising results.

View PDFchevron_right
A Survey Paper on Concept Mining in Text Documents
siva prasad

Concept Mining has become an important research area. Concept Mining is used to search or extract the concepts embedded in the text document. Concept based approach search for the informative terms based on their meaning rather than on the presence of the keyword in the text.

View PDFchevron_right
Concept Map Mining: A definition and a framework for its evaluation
Jorge J Villalon

"Concept maps are visual representations of knowledge, widely used in educational contexts. We use the term ”Concept Map Mining” (CMM) to refer to the automatic extraction of Concept Maps from documents such as essays. The principles behind CMM have been proposed for applications such as: information extraction in specific knowledge domains, the measurement of student understanding and misconceptions based on written essays, and as a preliminary step to creating domain ontologies. Previous work on the automatic extraction of concept maps present two problems: 1) overly simplistic and varying definitions of concept maps, and 2) the lack of an evaluation framework that can be used to measure the quality of the generated maps. In this paper, we propose a formal definition of the term CMM, with a focus on educational applications. We also propose an evaluation framework that will allow other researchers to share a common ground to evaluate the performance of CMM methods."

View PDFchevron_right
Concept Mining using Conceptual Ontological Graph (COG)
Mohamed Kamel

Concept mining (CM) is the area of exploring and finding links, associations, relationships, and patterns among huge collections of information. In this paper, we propose concept-based text representation, with an emphasis on using the proposed representation in different application s such as information retrieval, text summarization, and question answering. This work presents a new paradigm for concept mining by extracting the concept-based information from a raw text. At the text representation level, we introduce a sentence based conceptual ontological representation that builds concept-based representations for the whole document. A new concept-based similarity measure is proposed to measure the similarity of texts based on their meaning. The proposed approach is domain independent and it could be applied to general domain applications. The proposed approach has been applied to the domain of information retrieval and preliminary results are promising, and give an affirmation for proceeding in the right directions of this research.

View PDFchevron_right
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
Computer Science & Information Technology (CS & IT) Computer Science Conference Proceedings (CSCP)

In this study, a dictionary-based method is used to extract expressive concepts from documents. So far, there have been many studies concerning concept mining in English, but this area of study for Turkish, an agglutinative language, is still immature. We used dictionary instead of WordNet, a lexical database grouping words into synsets that is widely used for concept extraction. The dictionaries are rarely used in the domain of concept mining, but taking into account that dictionary entries have synonyms, hypernyms, hyponyms and other relationships in their meaning texts, the success rate has been high for determining concepts. This concept extraction method is implemented on documents, that are collected from different corpora.

View PDFchevron_right

Related topics

  • Computer Science
  • Natural Language Processing
  • Electrical and Computer Engineering
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved