Summary „Rough sets and Data mining” Vietnam national university in Hanoi, College of technology, Feb.2006.

Slides:



Advertisements
Similar presentations
Data Mining Lecture 9.
Advertisements

Frequent Itemset Mining Methods. The Apriori algorithm Finding frequent itemsets using candidate generation Seminal algorithm proposed by R. Agrawal and.
DECISION TREES. Decision trees  One possible representation for hypotheses.
Ch2 Data Preprocessing part3 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.
_ Rough Sets. Basic Concepts of Rough Sets _ Information/Decision Systems (Tables) _ Indiscernibility _ Set Approximation _ Reducts and Core _ Rough Membership.
Supervised Learning Techniques over Twitter Data Kleisarchaki Sofia.
Lazy vs. Eager Learning Lazy vs. eager learning
Data Mining Techniques So Far: Cluster analysis K-means Classification Decision Trees J48 (C4.5) Rule-based classification JRIP (RIPPER) Logistic Regression.
Exploratory Data Mining and Data Preparation
SAK 5609 DATA MINING Prof. Madya Dr. Md. Nasir bin Sulaiman
COMP 328: Midterm Review Spring 2010 Nevin L. Zhang Department of Computer Science & Engineering The Hong Kong University of Science & Technology
© Prentice Hall1 DATA MINING TECHNIQUES Introductory and Advanced Topics Eamonn Keogh (some slides adapted from) Margaret Dunham Dr. M.H.Dunham, Data Mining,
1 Fuzzy Signatures in SARS Student: Bai Qifeng Client: Prof. Tom Gedeon.
August 2005RSFDGrC 2005, Regina, Canada 1 Feature Selection Based on Relative Attribute Dependency: An Experimental Study Jianchao Han 1, Ricardo Sanchez.
Summarization of Frequent Pattern Mining. What is FPM? Why being frequent is so important? Application of FPM Decision make/Business Software Debugging.
Aprendizagem baseada em instâncias (K vizinhos mais próximos)
Copyright © 2004 Pearson Education, Inc.. Chapter 27 Data Mining Concepts.
Introduction. 1.Data Mining and Knowledge Discovery 2.Data Mining Methods 3.Supervised Learning 4.Unsupervised Learning 5.Other Learning Paradigms 6.Introduction.
Data Mining – Intro.
The application of rough sets analysis in activity-based modelling. Opportunities and constraints Speaker: Yanan Yean.
GUHA method in Data Mining Esko Turunen Tampere University of Technology Tampere, Finland.
CSC 478 Programming Data Mining Applications Course Summary Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence From Data Mining To Knowledge.
Data Mining Chun-Hung Chou
AR mining Implementation and comparison of three AR mining algorithms Xuehai Wang, Xiaobo Chen, Shen chen CSCI6405 class project.
Machine Learning Lecture 11 Summary G53MLE | Machine Learning | Dr Guoping Qiu1.
Algorithms: The Basic Methods Witten – Chapter 4 Charles Tappert Professor of Computer Science School of CSIS, Pace University.
Basic Data Mining Technique
1 Knowledge Discovery Transparencies prepared by Ho Tu Bao [JAIST] ITCS 6162.
From Rough Set Theory to Evidence Theory Roman Słowiński Laboratory of Intelligent Decision Support Systems Institute of Computing Science Poznań University.
Data Mining – Intro. Course Overview Spatial Databases Temporal and Spatio-Temporal Databases Multimedia Databases Data Mining.
Recursive Binary Partitioning Old Dogs with New Tricks KDD Conference 2009 David J. Slate and Peter W. Frey.
Multi-Relational Data Mining: An Introduction Joe Paulowskey.
Last Words DM 1. Mining Data Steams / Incremental Data Mining / Mining sensor data (e.g. modify a decision tree assuming that new examples arrive continuously,
Summary „Data mining” Vietnam national university in Hanoi, College of technology, Feb.2006.
Introduction to Data Mining by Yen-Hsien Lee Department of Information Management College of Management National Sun Yat-Sen University March 4, 2003.
Data Mining and Decision Support
Sotarat Thammaboosadee, Ph.D. EGIT563- Data Mining Individual Project Specification 1.
CSC 478 Programming Data Mining Applications Course Summary Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Copyright  2004 limsoon wong Using WEKA for Classification (without feature selection)
DECISION TREES Asher Moody, CS 157B. Overview  Definition  Motivation  Algorithms  ID3  Example  Entropy  Information Gain  Applications  Conclusion.
Kansas State University Department of Computing and Information Sciences CIS 890: Special Topics in Intelligent Systems Wednesday, November 15, 2000 Cecil.
Instance-Based Learning Evgueni Smirnov. Overview Instance-Based Learning Comparison of Eager and Instance-Based Learning Instance Distances for Instance-Based.
Tallahassee, Florida, 2016 CIS4930 Introduction to Data Mining Midterm Review Peixiang Zhao.
Tallahassee, Florida, 2016 CIS4930 Introduction to Data Mining Final Review Peixiang Zhao.
Data Mining: Concepts and Techniques1 Prediction Prediction vs. classification Classification predicts categorical class label Prediction predicts continuous-valued.
Data Transformation: Normalization
Prepared by: Mahmoud Rafeek Al-Farra
Introduction to Data Mining
RESEARCH APPROACH.
Data Mining 101 with Scikit-Learn
Data Mining: Concepts and Techniques (3rd ed
SEEM5770/ECLT5840 Course Review
Data Mining: Concepts and Techniques Course Outline
Data Mining II: Association Rule mining & Classification
Transactional data Algorithm Applications
Prepared by: Mahmoud Rafeek Al-Farra
Prepared by: Mahmoud Rafeek Al-Farra
Prepared by: Mahmoud Rafeek Al-Farra
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Opening Weka Select Weka from Start Menu Select Explorer Fall 2003
Classification and Prediction
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
CSCI N317 Computation for Scientific Applications Unit Weka
Graph Classification SEG 5010 Week 3.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
©Jiawei Han and Micheline Kamber
Avoid Overfitting in Classification
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Presentation transcript:

Summary „Rough sets and Data mining” Vietnam national university in Hanoi, College of technology, Feb.2006

Main topics: Definition, principles and functionalities of data mining systems Rough sets methodology to concept approximation and data mining Boolean reasoning approach to problem solving Data preprocessing and data cleaning methods Association rules Classification methods

Boolean reasoning methodology Monotone Boolean function Implicant, prime implicant Searching for minimal prime implicants of a monotone Boolean function

Data preprocessing and data cleaning Discretization methods Data reduction methods Missing values Outlier elimination Rough set methods for discretization and attribute reduction

Association rules Definition, possible applications Apriori search for frequent patterns and association rules Modifications of apriori algorithms: hash tree, Apriori-Tid, Apriori-Hybrid FP-tree method Relationship between association rule and rough set methods

Classification methods Instance-based classification techniques Bayesian classifiers Decision tree methods Decision rules methods Classifier evaluation techniques

Discernibility measure Applications of discernibility measure in  Feature selection  Discretization  Symbolic value grouping  Decision tree construction