Panel Discussion on Foundations of Data Mining at RSCTC2004 J. T. Yao University of Regina Web:

Slides:



Advertisements
Similar presentations
Protein Secondary Structure Prediction Using BLAST and Relaxed Threshold Rule Induction from Coverings Leong Lee Missouri University of Science and Technology,
Advertisements

Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
K The Common Core State Standards in Mathematics © Copyright 2011 Institute for Mathematics and Education Welcome to a clickable.
Hong Zhu Department of Computing and Communication Technologies Oxford Brookes University, Oxford OX33 1HX, UK COMPSAC 2012 PANEL.
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Techniques for Proving the Completeness of a Proof System Hongseok Yang Seoul National University Cristiano Calcagno Imperial College.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
Affinity Set and Its Applications Moussa Larbani and Yuh-Wen Chen.
From research question to objectives via a literature review Tim Dolin.
Huge Raw Data Cleaning Data Condensation Dimensionality Reduction Data Wrapping/ Description Machine Learning Classification Clustering Rule Generation.
Rough Sets Theory Speaker:Kun Hsiang.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
PR-OWL: A Framework for Probabilistic Ontologies by Paulo C. G. COSTA, Kathryn B. LASKEY George Mason University presented by Thomas Packer 1PR-OWL.
The Semantic Web Week 13 Module Website: Lecture: Knowledge Acquisition / Engineering Practical: Getting to know.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Research Project Mining Negative Rules in Large Databases using GRD.
Formal methods Basic concepts. Introduction  Just as models, formal methods is a complement to other specification methods.  Standard is model-based.
PRAGMATICS. 3- Pragmatics is the study of how more gets communicated than is said. It explores how a great deal of what is unsaid is recognized. 4.
Chapter 7 Reasoning about Knowledge by Neha Saxena Id: 13 CS 267.
Granular Computing for the Design of Information Retrieval Support System Y.Y. Yao Dept of Computer Science University of Regina Presented by Mohamad Seif.
Conceptual modelling. Overview - what is the aim of the article? ”We build conceptual models in our heads to solve problems in our everyday life”… ”By.
Foundations This chapter lays down the fundamental ideas and choices on which our approach is based. First, it identifies the needs of architects in the.
Equivalence Class Testing
Dataology Research Center, Fudan University Introduction to Dataology Yangyong Zhu 05/07/2009.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence From Data Mining To Knowledge.
Granular Computing for Machine Learning JingTao Yao Department of Computer Science, University of Regina
Abrar Fawaz AlAbed-AlHaq Kent State University October 28, 2011
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
COMP3503 Intro to Inductive Modeling
CS 478 – Tools for Machine Learning and Data Mining The Need for and Role of Bias.
Applying Belief Change to Ontology Evolution PhD Student Computer Science Department University of Crete Giorgos Flouris Research Assistant.
Introduction to Data Mining Group Members: Karim C. El-Khazen Pascal Suria Lin Gui Philsou Lee Xiaoting Niu.
Data Mining – A First View Roiger & Geatz. Definition Data mining is the process of employing one or more computer learning techniques to automatically.
Data Mining Chapter 1 Introduction -- Basic Data Mining Tasks -- Related Concepts -- Data Mining Techniques.
The tasks of logic Why we need more versatile tools Philosophy and logic 2013 Kyiv 25 May
1 A Conceptual Framework of Data Mining Y.Y. Yao Department of Computer Science, University of Regina Regina, Sask., Canada S4S 0A2
Pattern-directed inference systems
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Decision Trees. Decision trees Decision trees are powerful and popular tools for classification and prediction. The attractiveness of decision trees is.
1 Classes of association rules short overview Jan Rauch, Department of Knowledge and Information Engineering University of Economics, Prague.
6.1 © 2010 by Prentice Hall 6 Chapter Foundations of Business Intelligence: Databases and Information Management.
Multi-Relational Data Mining: An Introduction Joe Paulowskey.
3-1 Data Mining Kelby Lee. 3-2 Overview ¨ Transaction Database ¨ What is Data Mining ¨ Data Mining Primitives ¨ Data Mining Objectives ¨ Predictive Modeling.
1 The Theoretical Framework. A theoretical framework is similar to the frame of the house. Just as the foundation supports a house, a theoretical framework.
Program Analysis and Verification Spring 2014 Program Analysis and Verification Lecture 4: Axiomatic Semantics I Roman Manevich Ben-Gurion University.
Definition Applications Examples
Decision Mining in Prom A. Rozinat and W.M.P. van der Aalst Joosung, Ko.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
What is Artificial Intelligence?
Panel Discussion on Granular Computing at RSCTC2004 J. T. Yao University of Regina Web:
DATA MINING PREPARED BY RAJNIKANT MODI REFERENCE:DOUG ALEXANDER.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
ece 627 intelligent web: ontology and beyond
Anne Watson Hong Kong  grasp formal structure  think logically in spatial, numerical and symbolic relationships  generalise rapidly and broadly.
Modeling Security-Relevant Data Semantics Xue Ying Chen Department of Computer Science.
Modeling K The Common Core State Standards in Mathematics Geometry Measurement and Data The Number System Number and Operations.
Discuss how researchers analyze data obtained in observational research.
Ontologies, Conceptualizations, and Possible Worlds Revisiting “Formal Ontologies and Information Systems” 10 years later Nicola Guarino CNR Institute.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Optimization of Association Rules Extraction Through Exploitation of Context Dependent Constraints Arianna Gallo, Roberto Esposito, Rosa Meo, Marco Botta.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Multi-Class Sentiment Analysis with Clustering and Score Representation Yan Zhu.
Model Checking Early Requirements Specifications in Tropos Presented by Chin-Yi Tsai.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
Knowledge Representation Part I Ontology Jan Pettersen Nytun Knowledge Representation Part I, JPN, UiA1.
Mathematical Competencies A Framework for Mathematics Curricula in Engineering Education SEFI MWG Steering committee Burkhard ALPERS, Marie DEMLOVÁ,
Introduction Artificial Intelligent.
Manager’s Overview DoDAF 2.0 Meta Model (DM2) TBS dd mon 2009
Tantan Liu, Fan Wang, Gagan Agrawal The Ohio State University
Presentation transcript:

Panel Discussion on Foundations of Data Mining at RSCTC2004 J. T. Yao University of Regina Web:

What is the Foundations of Data Mining? DM research mainly focuses on algorithms and methodologies. There is a lack of study on mathematical modeling of, or foundations of, data mining The study of foundations of data mining is in its infancy, and there are probably more questions than answers. (Mannila 2000)

What is the Foundations of Data Mining? Chen's approach (2002): data mining can be studied from three different but related dimensions. The philosophical dimension deals with the nature and scope of data mining. The technical dimension covers data mining methods and techniques. The social dimension concern the social impact and consequences of data mining.

What is the Foundations of Data Mining? Xie and Raghavan's approach (2002): logical foundation of data mining based on Bacchus' probability logic. Precise definition of intuitive notions, such as ``pattern'', ``previously unknown knowledge'' and ``potentially useful knowledge''. A logic induction operator is defined for discovering ``previously unknown and potentially useful knowledge''.

What is the Foundations of Data Mining? Lin's (2002), Tsumoto (2002), and Yao's (2001) approaches: Granular computing as a basis for data mining. A concept consists of two parts, the intension and extension of the concept. The intension of a concept consists of properties objects. The extension of a concept is the set of instances. A rule can be expressed in the form, φ=>ψ where φ and ψ are intensions of two concepts. Rules are interpreted using extensions of the two concepts.

A Multi-level Framework for Modeling Data Mining The kernel focuses on the study of knowledge without reference to data mining algorithms. The technique levels focus on data mining algorithms without reference to particular application. The application levels focus on the utility of discovered knowledge with respect to particular domains of applications.

How do Rough Sets Contribute to FDM? Knowledge is an entity in the semantic levels of data. Knowledge embedded in data is related to semantic interpretations of data. The existence of knowledge in data is unrelated to whether we have an algorithm to extract it. We need to separate the study of knowledge and the study of data mining algorithms, and in turn to separate them from the study of utility of discovered knowledge.

How do Rough Sets Contribute to FDM? Concepts are used as a primitive notion of data mining: Every concept is understood as a unit of thoughts that consists of two parts, the intension and the extension of the concept. Tarski's approach is used to study concepts through the notions of a model and satisfiability. An information table is used as a model. The intension of a concept is expressed by a formula of a decision language in the information table. The extension of a concept is expressed by a subset of objects.

How do Rough Sets Contribute to FDM? Rules are used to express relationships. Rules can be interpreted and classified in terms of extensions of concepts and are based on probability theory. Many classes of rules can be defined: association rules, exception rules, peculiarity rules, similarity, negative association, conditional association rules. Both concepts and rules are used as examples to illustrate the focus of discussion at kernel level.

References Chen, Z. The three dimensions of data mining foundation, FDM’02, , Lin, T.Y. Issues in modeling for data mining, COMPSAC’02, , Mannila, H. Theoretical frameworks for data mining, SIGKDD Explorations, (2), 30-32, Tsumoto, S.,T.Y Lin, J.F. Peters. Foundations of Data Mining via Granular and Rough Computing. COMPSAC’02, , 2002 Yao, Y.Y. Modeling data mining with granular computing, COMPSAC’01, , Yao, Y.Y., A step towards the foundations of data mining, SPIE Vol. 5098, , 2003.