Book web site:

Slides:



Advertisements
Similar presentations
Google News Personalization: Scalable Online Collaborative Filtering
Advertisements

1 Data Mining Introductions What Is It? Cultures of Data Mining.
Mining of Massive Datasets: Course Introduction
Chapter 9 Business Intelligence Systems
Building an Intelligent Web: Theory and Practice Pawan Lingras Saint Mary’s University Rajendra Akerkar American University of Armenia and SIBER, India.
1 CS Data Mining Introductions What Is It? Cultures of Data Mining.
1 CS Data Mining Introductions What Is It? Cultures of Data Mining.
Chapter 14 The Second Component: The Database.
Data Mining – Intro.
Advanced Database Applications Database Indexing and Data Mining CS591-G1 -- Fall 2001 George Kollios Boston University.
Overview of Web Data Mining and Applications Part I
Presented To: Madam Nadia Gul Presented By: Bi Bi Mariam.
Computer Science Universiteit Maastricht Institute for Knowledge and Agent Technology Data mining and the knowledge discovery process Summer Course 2005.
Algorithms for Data Analytics Chapter 3. Plans Introduction to Data-intensive computing (Lecture 1) Statistical Inference: Foundations of statistics (Chapter.
Introduction to Data Mining Engineering Group in ACL.
1 © Goharian & Grossman 2003 Introduction to Data Mining (CS 422) Fall 2010.
OLAM and Data Mining: Concepts and Techniques. Introduction Data explosion problem: –Automated data collection tools and mature database technology lead.
Introduction 1 Wu-Jun Li Department of Computer Science and Engineering Shanghai Jiao Tong University Lecture 1: Introduction Mining Massive Datasets.
Data Mining. 2 Models Created by Data Mining Linear Equations Rules Clusters Graphs Tree Structures Recurrent Patterns.
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
Data Management Turban, Aronson, and Liang Decision Support Systems and Intelligent Systems, Seventh Edition.
CS525: Big Data Analytics Machine Learning on Hadoop Fall 2013 Elke A. Rundensteiner 1.
CIS 9002 Kannan Mohan Department of CIS Zicklin School of Business, Baruch College.
J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 2.
Chapter 1 Introduction to Data Mining
INTRODUCTION TO DATA MINING MIS2502 Data Analytics.
© 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang 5-1 Chapter 5 Business Intelligence: Data.
Data Mining Knowledge on rough set theory SUSHIL KUMAR SAHU.
Data Mining By Dave Maung.
Ihr Logo Chapter 5 Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization Turban, Aronson, and Liang.
LATENT SEMANTIC INDEXING Hande Zırtıloğlu Levent Altunyurt.
Data Mining – Intro. Course Overview Spatial Databases Temporal and Spatio-Temporal Databases Multimedia Databases Data Mining.
Big Data Analytics Large-Scale Data Management Big Data Analytics Data Science and Analytics How to manage very large amounts of data and extract value.
Chapter 5: Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization DECISION SUPPORT SYSTEMS AND BUSINESS.
Understanding the field & setting expectations.  Personal  International  UNT Alumni (Mathematics)  Academic  Economics & Mathematics  Professional.
Advanced Analytics on Hadoop Spring 2014 WPI, Mohamed Eltabakh 1.
 Frequent Word Combinations Mining and Indexing on HBase Hemanth Gokavarapu Santhosh Kumar Saminathan.
MIS2502: Data Analytics Advanced Analytics - Introduction.
Tallahassee, Florida, 2016 CIS4930 Introduction to Data Mining Introduction Peixiang Zhao.
HEMANTH GOKAVARAPU SANTHOSH KUMAR SAMINATHAN Frequent Word Combinations Mining and Indexing on HBase.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Mining of Massive Datasets Edited based on Leskovec’s from
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Chapter 3 Building Business Intelligence Chapter 3 DATABASES AND DATA WAREHOUSES Building Business Intelligence 6/22/2016 1Management Information Systems.
Lecture-6 Bscshelp.com. Todays Lecture  Which Kinds of Applications Are Targeted?  Business intelligence  Search engines.
CS570: Data Mining Spring 2010, TT 1 – 2:15pm Li Xiong.
July 7, 2016 Data Mining: Concepts and Techniques 1 1.
DATA MINING and VISUALIZATION Instructor: Dr. Matthew Iklé, Adams State University Remote Instructor: Dr. Hong Liu, Embry-Riddle Aeronautical University.
András Benczúr Head, “Big Data – Momentum” Research Group Big Data Analytics Institute for Computer.
Supplemental Chapter: Business Intelligence Information Systems Development.
Data mining in web applications
Data Mining Modified from
CSCI5570 Large Scale Data Processing Systems
Data Analytics 1 - THE HISTORY AND CONCEPTS OF DATA ANALYTICS
Data Mining – Intro.
MIS2502: Data Analytics Advanced Analytics - Introduction
School of Computer Science & Engineering
Data Mining 101 with Scikit-Learn
Introduction C.Eng 714 Spring 2010.
Mining Massive Datasets: Review
What is Pattern Recognition?
Data Mining Modified from
Gerd Kortemeyer, William F. Punch
A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence Yue Ming NJIT#:
Data Warehousing and Data Mining
Data Warehousing Data Mining Privacy
Big DATA.
Web Mining Research: A Survey
Presentation transcript:

Book web site:

Data contains value and knowledge

 But to extract the knowledge data needs to be  Stored  Managed  And ANALYZED  this class Data Mining ≈ Big Data ≈ Predictive Analytics ≈ Data Science

 Given lots of data  Discover patterns and models that are:  Valid: hold on new data with some certainty  Useful: should be possible to act on the item  Unexpected: non-obvious to the system  Understandable: humans should be able to interpret the pattern

 Descriptive methods  Find human-interpretable patterns that describe the data  Example: Clustering  Predictive methods  Use some variables to predict unknown or future values of other variables  Example: Recommender systems

 A risk with “Data mining” is that an analyst can “discover” patterns that are meaningless  Statisticians call it Bonferroni’s principle:  Roughly, if you look in more places for interesting patterns than your amount of data will support, you are bound to find crap

Example:  We want to find (unrelated) people who at least twice have stayed at the same hotel on the same day  10 9 people being tracked  1,000 days  Each person stays in a hotel 1% of time (1 day out of 100)  Hotels hold 100 people (so 10 5 hotels)  If everyone behaves randomly (i.e., no terrorists) will the data mining detect anything suspicious?  Expected number of “suspicious” pairs of people:  250,000  … too many combinations to check – we need to have some additional evidence to find “suspicious” pairs of people in some more efficient way

Scalability Streaming Context Quality Usage

 Data mining overlaps with:  Databases: Large-scale data, simple queries  Machine learning: Small data, Complex models  CS Theory: (Randomized) Algorithms  Different cultures:  To a DB person, data mining is an extreme form of analytic processing – queries that examine large amounts of data  Result is the query answer  To a ML person, data-mining is the inference of models  Result is the parameters of the model  In this class we will do both! Machine Learning CS Theory Data Mining Database systems

 This class overlaps with machine learning, statistics, artificial intelligence, databases but more stress on  Scalability (big data)  Algorithms  Computing architectures  Automation for handling large data Machine Learning Statistics Data Mining Database systems

 We will learn to mine different types of data:  Data is high dimensional  Data is a graph  Data is infinite/never-ending  Data is labeled  We will learn to use different models of computation:  MapReduce  Streams and online algorithms  Single machine in-memory

 1. Distributed file systems and map-reduce as a tool for creating parallel  algorithms that succeed on very large amounts of data.  2. Similarity search, including the key techniques of minhashing and localitysensitive  hashing.  3. Data-stream processing and specialized algorithms for dealing with data  that arrives so fast it must be processed immediately or lost.  4. The technology of search engines, including Google’s PageRank, link-spam  detection, and the hubs-and-authorities approach.  5. Frequent-itemset mining, including association rules, market- baskets, the  A-Priori Algorithm and its improvements.  6. Algorithms for clustering very large, high-dimensional datasets.

 7. Two key problems for Web applications: managing advertising and recommendation  systems.  8. Algorithms for analyzing and mining the structure of very large graphs,  especially social-network graphs.  9. Techniques for obtaining the important properties of a large dataset by  dimensionality reduction, including singular-value decomposition and latent  semantic indexing.  10. Machine-learning algorithms that can be applied to very large data, such  as perceptrons, support-vector machines, and gradient descent.

High dim. data Locality sensitive hashing Clustering Dimensional ity reduction Graph data PageRank, SimRank Community Detection Spam Detection Infinite data Filtering data streams Web advertising Queries on streams Machine learning SVM Decision Trees Perceptron, kNN Apps Recommen der systems Association Rules Duplicate document detection