DMQL(Data Mining Query Language).pptx
•Download as PPTX, PDF•
0 likes•524 views
The document discusses the Data Mining Query Language (DMQL), which was proposed for the DBMiner data mining system. DMQL is based on SQL and allows users to define data mining tasks by specifying data warehouses, data marts, and types of knowledge to mine, such as characterization, discrimination, association, classification, and prediction. It also provides syntax for concept hierarchy specification to organize data attributes into different levels.
Report
Share
Report
Share
Recommended
Data mining query language
The document discusses different levels of coupling between data mining (DM) systems and database/data warehouse (DB/DW) systems. It defines:
1) No coupling as DM systems operating independently without utilizing any DB/DW functions.
2) Loose coupling as DM systems fetching data from and storing results in DB/DW systems.
3) Semi-tight coupling as DM systems linking to and using efficient implementations of some DM functions within DB/DW systems.
4) Tight coupling as DM systems being fully integrated with and optimized based on the query processing and data structures of DB/DW systems.
Data mining , Knowledge Discovery Process, Classification
The document provides an overview of data mining techniques and processes. It discusses data mining as the process of extracting knowledge from large amounts of data. It describes common data mining tasks like classification, regression, clustering, and association rule learning. It also outlines popular data mining processes like CRISP-DM and SEMMA that involve steps of business understanding, data preparation, modeling, evaluation and deployment. Decision trees are presented as a popular classification technique that uses a tree structure to split data into nodes and leaves to classify examples.
Challenges of Conventional Systems.pptx
The document discusses challenges with conventional analytics systems including:
- They are unable to efficiently analyze unstructured data and are built on relational models.
- They are batch-oriented and users must wait for overnight processing before gaining insights.
- Parallelism is achieved through costly hardware instead of distributed processing models.
- They have difficulties with data volume, velocity, variety and capturing data from different sources.
Data cubes
This document discusses data cubes, which are multidimensional data structures used in online analytical processing (OLAP) to enable fast retrieval of data organized by dimensions and measures. Data cubes can have 2-3 dimensions or more and contain measures like costs or units. Key concepts are slicing to select a 2D page, dicing to define a subcube, and rotating to change dimensional orientation. Data cubes represent categories through dimensions and levels, and store facts as measures in cells. They can be pre-computed fully, not at all, or partially to balance query speed and memory usage. Totals can also be stored to improve performance of aggregate queries.
Data Mining & Applications
This document discusses data mining and its applications. It defines data mining as using algorithms to discover patterns in large data sets beyond simple analysis. It then provides examples of data mining applications, including market basket analysis, education, manufacturing, customer relationship management, fraud detection, research analysis, criminal investigation, and bioinformatics. The document also outlines the typical stages of the data mining process: data understanding, data preparation, modeling, evaluation, and deployment.
Artificial Neural Networks for Data Mining
Artificial Neural Networks for Data MiningAmity University | FMS - DU | IMT | Stratford University | KKMI International Institute | AIMA | DTU
This Presentation covers Data Mining: Classification and Prediction, NEURAL NETWORK REPRESENTATION, NEURAL NETWORK APPLICATION DEVELOPMENT, BENEFITS AND LIMITATIONS OF NEURAL NETWORKS, Neural Networks, Real Estate Appraiser, Kinds of Data Mining Problems, Data Mining Techniques, Learning in ANN, Elements of ANN, Neural Network Architectures Recurrent Neural Networks and ANN Software.Discretization and concept hierarchy(os)
This document discusses different types of concept hierarchies that can be used in data warehousing including schema hierarchies, set grouping hierarchies, and operation-derived hierarchies. It also discusses techniques for data discretization such as binning methods and concept hierarchies that reduce data by replacing low-level concepts with higher-level concepts. Finally, it briefly mentions histogram analysis, clustering analysis, and different ways concept hierarchies can be specified including explicitly by users or generated automatically through analysis.
Web Mining & Text Mining
Web mining is the application of data mining techniques to extract knowledge from web data, including web content, structure, and usage data. Web content mining analyzes text, images, and other unstructured data on web pages using natural language processing and information retrieval. Web structure mining examines the hyperlinks between pages to discover relationships. Web usage mining applies data mining methods to server logs and other web data to discover patterns of user behavior on websites. Text mining aims to extract useful information from unstructured text documents using techniques like summarization, information extraction, categorization, and sentiment analysis.
Recommended
Data mining query language
The document discusses different levels of coupling between data mining (DM) systems and database/data warehouse (DB/DW) systems. It defines:
1) No coupling as DM systems operating independently without utilizing any DB/DW functions.
2) Loose coupling as DM systems fetching data from and storing results in DB/DW systems.
3) Semi-tight coupling as DM systems linking to and using efficient implementations of some DM functions within DB/DW systems.
4) Tight coupling as DM systems being fully integrated with and optimized based on the query processing and data structures of DB/DW systems.
Data mining , Knowledge Discovery Process, Classification
The document provides an overview of data mining techniques and processes. It discusses data mining as the process of extracting knowledge from large amounts of data. It describes common data mining tasks like classification, regression, clustering, and association rule learning. It also outlines popular data mining processes like CRISP-DM and SEMMA that involve steps of business understanding, data preparation, modeling, evaluation and deployment. Decision trees are presented as a popular classification technique that uses a tree structure to split data into nodes and leaves to classify examples.
Challenges of Conventional Systems.pptx
The document discusses challenges with conventional analytics systems including:
- They are unable to efficiently analyze unstructured data and are built on relational models.
- They are batch-oriented and users must wait for overnight processing before gaining insights.
- Parallelism is achieved through costly hardware instead of distributed processing models.
- They have difficulties with data volume, velocity, variety and capturing data from different sources.
Data cubes
This document discusses data cubes, which are multidimensional data structures used in online analytical processing (OLAP) to enable fast retrieval of data organized by dimensions and measures. Data cubes can have 2-3 dimensions or more and contain measures like costs or units. Key concepts are slicing to select a 2D page, dicing to define a subcube, and rotating to change dimensional orientation. Data cubes represent categories through dimensions and levels, and store facts as measures in cells. They can be pre-computed fully, not at all, or partially to balance query speed and memory usage. Totals can also be stored to improve performance of aggregate queries.
Data Mining & Applications
This document discusses data mining and its applications. It defines data mining as using algorithms to discover patterns in large data sets beyond simple analysis. It then provides examples of data mining applications, including market basket analysis, education, manufacturing, customer relationship management, fraud detection, research analysis, criminal investigation, and bioinformatics. The document also outlines the typical stages of the data mining process: data understanding, data preparation, modeling, evaluation, and deployment.
Artificial Neural Networks for Data Mining
Artificial Neural Networks for Data MiningAmity University | FMS - DU | IMT | Stratford University | KKMI International Institute | AIMA | DTU
This Presentation covers Data Mining: Classification and Prediction, NEURAL NETWORK REPRESENTATION, NEURAL NETWORK APPLICATION DEVELOPMENT, BENEFITS AND LIMITATIONS OF NEURAL NETWORKS, Neural Networks, Real Estate Appraiser, Kinds of Data Mining Problems, Data Mining Techniques, Learning in ANN, Elements of ANN, Neural Network Architectures Recurrent Neural Networks and ANN Software.Discretization and concept hierarchy(os)
This document discusses different types of concept hierarchies that can be used in data warehousing including schema hierarchies, set grouping hierarchies, and operation-derived hierarchies. It also discusses techniques for data discretization such as binning methods and concept hierarchies that reduce data by replacing low-level concepts with higher-level concepts. Finally, it briefly mentions histogram analysis, clustering analysis, and different ways concept hierarchies can be specified including explicitly by users or generated automatically through analysis.
Web Mining & Text Mining
Web mining is the application of data mining techniques to extract knowledge from web data, including web content, structure, and usage data. Web content mining analyzes text, images, and other unstructured data on web pages using natural language processing and information retrieval. Web structure mining examines the hyperlinks between pages to discover relationships. Web usage mining applies data mining methods to server logs and other web data to discover patterns of user behavior on websites. Text mining aims to extract useful information from unstructured text documents using techniques like summarization, information extraction, categorization, and sentiment analysis.
Cluster analysis
Cluster analysis involves grouping data objects into clusters so that objects within the same cluster are more similar to each other than objects in other clusters. There are several major clustering approaches including partitioning methods that iteratively construct partitions, hierarchical methods that create hierarchical decompositions, density-based methods based on connectivity and density, grid-based methods using a multi-level granularity structure, and model-based methods that find the best fit of a model to the clusters. Partitioning methods like k-means and k-medoids aim to optimize a partitioning criterion by iteratively updating cluster centroids or medoids.
Association rule mining
This document discusses association rule mining. Association rule mining finds frequent patterns, associations, correlations, or causal structures among items in transaction databases. The Apriori algorithm is commonly used to find frequent itemsets and generate association rules. It works by iteratively joining frequent itemsets from the previous pass to generate candidates, and then pruning the candidates that have infrequent subsets. Various techniques can improve the efficiency of Apriori, such as hashing to count itemsets and pruning transactions that don't contain frequent itemsets. Alternative approaches like FP-growth compress the database into a tree structure to avoid costly scans and candidate generation. The document also discusses mining multilevel, multidimensional, and quantitative association rules.
Data Mining: Classification and analysis
Data mining involves classification, cluster analysis, outlier mining, and evolution analysis. Classification models data to distinguish classes using techniques like decision trees or neural networks. Cluster analysis groups similar objects without labels, while outlier mining finds irregular objects. Evolution analysis models changes over time. Data mining performance considers algorithm efficiency, scalability, and handling diverse and complex data types from multiple sources.
Data Mining
Data Mining, KDD Process, Data mining functionalities, Characterization,
Discrimination ,
Association,
Classification,
Prediction,
Clustering,
Outlier analysis, Data Cleaning as a Process
Association rule mining.pptx
This document discusses data mining techniques, including the data mining process and common techniques like association rule mining. It describes the data mining process as involving data gathering, preparation, mining the data using algorithms, and analyzing and interpreting the results. Association rule mining is explained in detail, including how it can be used to identify relationships between frequently purchased products. Methods for mining multilevel and multidimensional association rules are also summarized.
Data preprocessing
Data preprocessing techniques
See my Paris applied psychology conference paper here
https://www.slideshare.net/jasonrodrigues/paris-conference-on-applied-psychology
or
https://prezi.com/view/KBP8JnekVH9LkLOiKY3w/
Decision trees
This document discusses decision trees for data classification. It defines a decision tree as a tree where internal nodes represent attributes, branches represent attribute values, and leaf nodes represent class predictions. It describes the basic decision tree algorithm which builds the tree by recursively splitting the training data on attributes and stopping when data is pure or stopping criteria are met. Finally, it notes advantages like interpretability but also disadvantages like potential overfitting and issues with non-numeric data.
Density based methods
Density-Based Clustering refers to one of the most popular unsupervised learning methodologies used in model building and machine learning algorithms .
Clustering in Data Mining
Clustering is an unsupervised learning technique used to group unlabeled data points together based on similarities. It aims to maximize similarity within clusters and minimize similarity between clusters. There are several clustering methods including partitioning, hierarchical, density-based, grid-based, and model-based. Clustering has many applications such as pattern recognition, image processing, market research, and bioinformatics. It is useful for extracting hidden patterns from large, complex datasets.
Clustering paradigms and Partitioning Algorithms
The PPT is about the Clustering paradigms and Partitioning Algorithms by K means and K-method in Data Mining and Data Warehousing
Data cube computation
Data cube computation involves precomputing aggregations to enable fast query performance. There are different materialization strategies like full cubes, iceberg cubes, and shell cubes. Full cubes precompute all aggregations but require significant storage, while iceberg cubes only store aggregations that meet a threshold. Computation strategies include sorting and grouping to aggregate similar values, caching intermediate results, and aggregating from smallest child cuboids first. The Apriori pruning method can efficiently compute iceberg cubes by avoiding computing descendants of cells that do not meet the minimum support threshold.
3.1 clustering
Cluster analysis is an unsupervised machine learning technique that groups similar data objects into clusters. It finds internal structures within unlabeled data by partitioning it into groups based on similarity. Some key applications of cluster analysis include market segmentation, document classification, and identifying subtypes of diseases. The quality of clusters depends on both the similarity measure used and how well objects are grouped within each cluster versus across clusters.
01 Introduction to Data Mining
Data mining involves finding hidden patterns in large datasets. It differs from traditional data access in that the query may be unclear, the data has been preprocessed, and the output is an analysis rather than a data subset. Data mining algorithms attempt to fit models to the data by examining attributes, criteria for preference of one model over others, and search techniques. Common data mining tasks include classification, regression, clustering, association rule learning, and prediction.
Data Mining: Data cube computation and data generalization
Data generalization abstracts data from a low conceptual level to higher levels. Different cube materialization methods include full, iceberg, closed, and shell cubes. The Apriori property states that if a cell does not meet minimum support, neither will its descendants, and can reduce iceberg cube computation. BUC constructs cubes from the apex downward, allowing pruning using Apriori and sharing partitioning costs. Discovery-driven exploration assists users in intelligently exploring aggregated data cubes. Constrained gradient analysis incorporates significance, probe, and gradient constraints to reduce the search space. Attribute-oriented induction generalizes based on attribute values to characterize data. Attribute generalization is controlled through thresholds and relations.
Data mining primitives
Data mining primitives include task-relevant data, the kind of knowledge to be mined, background knowledge such as concept hierarchies, interestingness measures, and methods for presenting discovered patterns. A data mining query specifies these primitives to guide the knowledge discovery process. Background knowledge like concept hierarchies allow mining patterns at different levels of abstraction. Interestingness measures estimate pattern simplicity, certainty, utility, and novelty to filter uninteresting results. Discovered patterns can be presented through various visualizations including rules, tables, charts, and decision trees.
Neural network
Neural networks are mathematical models inspired by biological neural networks. They are useful for pattern recognition and data classification through a learning process of adjusting synaptic connections between neurons. A neural network maps input nodes to output nodes through an arbitrary number of hidden nodes. It is trained by presenting examples to adjust weights using methods like backpropagation to minimize error between actual and predicted outputs. Neural networks have advantages like noise tolerance and not requiring assumptions about data distributions. They have applications in finance, marketing, and other fields, though designing optimal network topology can be challenging.
Clustering & classification
This document provides an overview of clustering and classification techniques in data mining. It defines clustering and classification as unsupervised and supervised learning respectively. The document discusses how classification works by building a model from training data and then using the model to classify new data. For clustering, it explains that clusters are formed by grouping similar data objects without predefined labels. The document also describes different types of clustering techniques like hierarchical, partitioning, and probabilistic clustering. Finally, it provides a step-by-step explanation of the k-means clustering algorithm.
Clusters techniques
The document discusses different clustering techniques used for grouping large amounts of data. It covers partitioning methods like k-means and k-medoids that organize data into exclusive groups. It also describes hierarchical methods like agglomerative and divisive clustering that arrange data into nested groups or trees. Additionally, it mentions density-based and grid-based clustering and provides algorithms for different clustering approaches.
Ensemble learning
Ensemble Learning is a technique that creates multiple models and then combines them to produce improved results.
Ensemble learning usually produces more accurate solutions than a single model would.
Decision tree induction \ Decision Tree Algorithm with Example| Data science
This Decision Tree Algorithm in Machine Learning Presentation will help you understand all the basics of Decision Tree along with what Machine Learning is, what Machine Learning is, what Decision Tree is, the advantages and disadvantages of Decision Tree, how Decision Tree algorithm works with resolved examples, and at the end of the decision Tree use case/demo in Python for loan payment. For both beginners and experts who want to learn Machine Learning Algorithms, this Decision Tree tutorial is perfect.
Data mining approaches and methods
The document discusses Data Mining Query Language (DMQL), which is based on SQL and allows users to define data mining tasks. DMQL can be used to specify data mining primitives and define data warehouses and data marts. The syntax of DMQL is presented, including commands to use a database or data warehouse, specify attributes or dimensions, and filter from relations using conditions. An example DMQL query is provided to select from multiple tables and group results by date. References on data warehousing, OLAP, and data mining concepts are also listed.
dbms first unit
SQL is a standard language used to communicate with relational database management systems. It allows users to define, manipulate, and query data within these databases. The basic structure of an SQL query consists of SELECT, FROM, and WHERE clauses that correspond to operations in relational algebra like projection, Cartesian product, and selection. SQL provides tools for managing data like DDL/DML commands, views, aggregates, and subqueries to retrieve and analyze data flexibly.
More Related Content
What's hot
Cluster analysis
Cluster analysis involves grouping data objects into clusters so that objects within the same cluster are more similar to each other than objects in other clusters. There are several major clustering approaches including partitioning methods that iteratively construct partitions, hierarchical methods that create hierarchical decompositions, density-based methods based on connectivity and density, grid-based methods using a multi-level granularity structure, and model-based methods that find the best fit of a model to the clusters. Partitioning methods like k-means and k-medoids aim to optimize a partitioning criterion by iteratively updating cluster centroids or medoids.
Association rule mining
This document discusses association rule mining. Association rule mining finds frequent patterns, associations, correlations, or causal structures among items in transaction databases. The Apriori algorithm is commonly used to find frequent itemsets and generate association rules. It works by iteratively joining frequent itemsets from the previous pass to generate candidates, and then pruning the candidates that have infrequent subsets. Various techniques can improve the efficiency of Apriori, such as hashing to count itemsets and pruning transactions that don't contain frequent itemsets. Alternative approaches like FP-growth compress the database into a tree structure to avoid costly scans and candidate generation. The document also discusses mining multilevel, multidimensional, and quantitative association rules.
Data Mining: Classification and analysis
Data mining involves classification, cluster analysis, outlier mining, and evolution analysis. Classification models data to distinguish classes using techniques like decision trees or neural networks. Cluster analysis groups similar objects without labels, while outlier mining finds irregular objects. Evolution analysis models changes over time. Data mining performance considers algorithm efficiency, scalability, and handling diverse and complex data types from multiple sources.
Data Mining
Data Mining, KDD Process, Data mining functionalities, Characterization,
Discrimination ,
Association,
Classification,
Prediction,
Clustering,
Outlier analysis, Data Cleaning as a Process
Association rule mining.pptx
This document discusses data mining techniques, including the data mining process and common techniques like association rule mining. It describes the data mining process as involving data gathering, preparation, mining the data using algorithms, and analyzing and interpreting the results. Association rule mining is explained in detail, including how it can be used to identify relationships between frequently purchased products. Methods for mining multilevel and multidimensional association rules are also summarized.
Data preprocessing
Data preprocessing techniques
See my Paris applied psychology conference paper here
https://www.slideshare.net/jasonrodrigues/paris-conference-on-applied-psychology
or
https://prezi.com/view/KBP8JnekVH9LkLOiKY3w/
Decision trees
This document discusses decision trees for data classification. It defines a decision tree as a tree where internal nodes represent attributes, branches represent attribute values, and leaf nodes represent class predictions. It describes the basic decision tree algorithm which builds the tree by recursively splitting the training data on attributes and stopping when data is pure or stopping criteria are met. Finally, it notes advantages like interpretability but also disadvantages like potential overfitting and issues with non-numeric data.
Density based methods
Density-Based Clustering refers to one of the most popular unsupervised learning methodologies used in model building and machine learning algorithms .
Clustering in Data Mining
Clustering is an unsupervised learning technique used to group unlabeled data points together based on similarities. It aims to maximize similarity within clusters and minimize similarity between clusters. There are several clustering methods including partitioning, hierarchical, density-based, grid-based, and model-based. Clustering has many applications such as pattern recognition, image processing, market research, and bioinformatics. It is useful for extracting hidden patterns from large, complex datasets.
Clustering paradigms and Partitioning Algorithms
The PPT is about the Clustering paradigms and Partitioning Algorithms by K means and K-method in Data Mining and Data Warehousing
Data cube computation
Data cube computation involves precomputing aggregations to enable fast query performance. There are different materialization strategies like full cubes, iceberg cubes, and shell cubes. Full cubes precompute all aggregations but require significant storage, while iceberg cubes only store aggregations that meet a threshold. Computation strategies include sorting and grouping to aggregate similar values, caching intermediate results, and aggregating from smallest child cuboids first. The Apriori pruning method can efficiently compute iceberg cubes by avoiding computing descendants of cells that do not meet the minimum support threshold.
3.1 clustering
Cluster analysis is an unsupervised machine learning technique that groups similar data objects into clusters. It finds internal structures within unlabeled data by partitioning it into groups based on similarity. Some key applications of cluster analysis include market segmentation, document classification, and identifying subtypes of diseases. The quality of clusters depends on both the similarity measure used and how well objects are grouped within each cluster versus across clusters.
01 Introduction to Data Mining
Data mining involves finding hidden patterns in large datasets. It differs from traditional data access in that the query may be unclear, the data has been preprocessed, and the output is an analysis rather than a data subset. Data mining algorithms attempt to fit models to the data by examining attributes, criteria for preference of one model over others, and search techniques. Common data mining tasks include classification, regression, clustering, association rule learning, and prediction.
Data Mining: Data cube computation and data generalization
Data generalization abstracts data from a low conceptual level to higher levels. Different cube materialization methods include full, iceberg, closed, and shell cubes. The Apriori property states that if a cell does not meet minimum support, neither will its descendants, and can reduce iceberg cube computation. BUC constructs cubes from the apex downward, allowing pruning using Apriori and sharing partitioning costs. Discovery-driven exploration assists users in intelligently exploring aggregated data cubes. Constrained gradient analysis incorporates significance, probe, and gradient constraints to reduce the search space. Attribute-oriented induction generalizes based on attribute values to characterize data. Attribute generalization is controlled through thresholds and relations.
Data mining primitives
Data mining primitives include task-relevant data, the kind of knowledge to be mined, background knowledge such as concept hierarchies, interestingness measures, and methods for presenting discovered patterns. A data mining query specifies these primitives to guide the knowledge discovery process. Background knowledge like concept hierarchies allow mining patterns at different levels of abstraction. Interestingness measures estimate pattern simplicity, certainty, utility, and novelty to filter uninteresting results. Discovered patterns can be presented through various visualizations including rules, tables, charts, and decision trees.
Neural network
Neural networks are mathematical models inspired by biological neural networks. They are useful for pattern recognition and data classification through a learning process of adjusting synaptic connections between neurons. A neural network maps input nodes to output nodes through an arbitrary number of hidden nodes. It is trained by presenting examples to adjust weights using methods like backpropagation to minimize error between actual and predicted outputs. Neural networks have advantages like noise tolerance and not requiring assumptions about data distributions. They have applications in finance, marketing, and other fields, though designing optimal network topology can be challenging.
Clustering & classification
This document provides an overview of clustering and classification techniques in data mining. It defines clustering and classification as unsupervised and supervised learning respectively. The document discusses how classification works by building a model from training data and then using the model to classify new data. For clustering, it explains that clusters are formed by grouping similar data objects without predefined labels. The document also describes different types of clustering techniques like hierarchical, partitioning, and probabilistic clustering. Finally, it provides a step-by-step explanation of the k-means clustering algorithm.
Clusters techniques
The document discusses different clustering techniques used for grouping large amounts of data. It covers partitioning methods like k-means and k-medoids that organize data into exclusive groups. It also describes hierarchical methods like agglomerative and divisive clustering that arrange data into nested groups or trees. Additionally, it mentions density-based and grid-based clustering and provides algorithms for different clustering approaches.
Ensemble learning
Ensemble Learning is a technique that creates multiple models and then combines them to produce improved results.
Ensemble learning usually produces more accurate solutions than a single model would.
Decision tree induction \ Decision Tree Algorithm with Example| Data science
This Decision Tree Algorithm in Machine Learning Presentation will help you understand all the basics of Decision Tree along with what Machine Learning is, what Machine Learning is, what Decision Tree is, the advantages and disadvantages of Decision Tree, how Decision Tree algorithm works with resolved examples, and at the end of the decision Tree use case/demo in Python for loan payment. For both beginners and experts who want to learn Machine Learning Algorithms, this Decision Tree tutorial is perfect.
What's hot (20)
Data Mining: Data cube computation and data generalization
Data Mining: Data cube computation and data generalization
Decision tree induction \ Decision Tree Algorithm with Example| Data science
Decision tree induction \ Decision Tree Algorithm with Example| Data science
Similar to DMQL(Data Mining Query Language).pptx
Data mining approaches and methods
The document discusses Data Mining Query Language (DMQL), which is based on SQL and allows users to define data mining tasks. DMQL can be used to specify data mining primitives and define data warehouses and data marts. The syntax of DMQL is presented, including commands to use a database or data warehouse, specify attributes or dimensions, and filter from relations using conditions. An example DMQL query is provided to select from multiple tables and group results by date. References on data warehousing, OLAP, and data mining concepts are also listed.
dbms first unit
SQL is a standard language used to communicate with relational database management systems. It allows users to define, manipulate, and query data within these databases. The basic structure of an SQL query consists of SELECT, FROM, and WHERE clauses that correspond to operations in relational algebra like projection, Cartesian product, and selection. SQL provides tools for managing data like DDL/DML commands, views, aggregates, and subqueries to retrieve and analyze data flexibly.
Data Mining Presentation on Science Day 2023
The document discusses data mining primitives, languages, and system architecture. It defines data mining as extracting knowledge from large amounts of data and describes the typical components of a data mining system, including a user interface, data mining engine, database, and knowledge base. It then outlines several key data mining primitives, such as specifying the relevant data, type of knowledge to mine, background knowledge, and interestingness measures. Finally, it discusses languages for data mining, noting the challenges in designing one language to handle different mining tasks and describing some elements of the Data Mining Query Language (DMQL).
Data mining
This document discusses task relevant data, discretization, and concept hierarchies in data mining. It defines task relevant data as the portions of a database or data set of interest to a user, including relevant attributes, dimensions, and selection criteria. Discretization reduces continuous attribute values to intervals, while concept hierarchies group low-level concepts into higher-level generalized concepts. Methods for generating concept hierarchies include binning, histogram analysis, clustering analysis, and analyzing attribute distinct values.
Bca examination 2017 dbms
Purpose of the data base system, data abstraction, data model, data independence, data definition
language, data manipulation language, data base manager, data base administrator, data base users,
overall structure.
ER Models, entities, mapping constrains, keys, E-R diagram, reduction E-R diagrams to tables,
generatio, aggregation, design of an E-R data base scheme.
Oracle RDBMS, architecture, kernel, system global area (SGA), data base writer, log writer, process
monitor, archiver, database files, control files, redo log files, oracle utilities.
SQL: commands and data types, data definition language commands, data manipulation commands,
data query language commands, transaction language control commands, data control language
commands.
Joins, equi-joins, non-equi-joins, self joins, other joins, aggregate functions, math functions, string
functions, group by clause, data function and concepts of null values, sub-querries, views.
PL/SQL, basics of pl/sql, data types, control structures, database access with PL/SQL, data base
connections, transaction management, data base locking, cursor management.
Data mining-primitives-languages-and-system-architectures2641
This document discusses the key primitives, languages, and architectures for data mining systems. It describes five primitives for specifying a data mining task: task-relevant data, kind of knowledge to be mined, background knowledge, interestingness measures, and knowledge presentation. It also discusses data mining query languages like DMQL and system architectures ranging from no coupling to tight coupling with database/data warehouse systems.
Performance analysis of machine learning algorithms on self localization system1
Performance analysis of machine learning algorithms on self localization system
output screens,
project output,
python projects,
machinelearning projects,
data science projects,
Artificial Intelegance projects,
support vector machine,
ramdom forest tree,
Dession tree,
linear Regression,
logistic regression,
Feature Selection,
Naive Bayes,
Machine learning Algorithms,
Dimensionality Reduction Algorithms,
Gradient Boosting algorithm,
Logistic Regression,
TensorFlow,Scikit-Learn,Numpy,Keras,PyTorch ,LightGBM,
Eli5 ,SciPy,Theano,Pandas,imageProcessing
Deep Learning,
IRE Semantic Annotation of Documents
Semantic annotation is done through first representing words and documents in the vector space model using Word2Vec and Doc2Vec implementations, the vectors are taken as features into a classifier, trained and a model is made which can classify a document with ACM classification tree categories, with the help of Wikipedia corpus.
Project Presentation: https://youtu.be/706HJteh1xc
Project Webpage: http://rohitsakala.github.io/semanticAnnotationAcmCategories/
Source Code: https://github.com/rohitsakala/semanticAnnotationAcmCategories
References:
Quoc V. Le, and Tomas Mikolov, ''Distributed Representations of Sentences and Documents ICML", 2014
Discriminant analysis using spss
This document provides an overview and agenda for a presentation on multivariate analysis and discriminant analysis using SPSS. It introduces the presenter, Dr. Nisha Arora, and lists her areas of expertise including statistics, machine learning, and teaching online courses in programs like R and Python. The agenda outlines concepts in discriminant analysis and how to perform it in SPSS, including data preparation, assumptions, interpretation of outputs, and ways to improve the analysis model.
Basics of data structure
1. A data structure organizes and collects data in a way that allows for efficient operations on that data through relationships between data elements.
2. Data structures implement abstract data types which specify the operations and complexity of manipulating the data.
3. Common terminology includes data, data types, variables, records, programs, and abstract data types.
dataminingclassificationprediction123 .pptx
This document discusses classification and prediction techniques for data analysis. Classification predicts categorical labels, while prediction models continuous values. Common algorithms include decision tree induction and Naive Bayesian classification. Decision trees use measures like information gain to build classifiers by recursively partitioning training data. Naive Bayesian classifiers apply Bayes' theorem to estimate probabilities for classification. Both approaches are popular due to their accuracy, speed and interpretability.
Etl Overview (Extract, Transform, And Load)
The document provides an overview of IBM Ascential ETL tools DataStage and QualityStage. QualityStage is used for data cleansing and standardization tasks like investigating data patterns, standardizing formats, matching records, and determining which data survives from source to target. DataStage is used for data transformation and movement between source systems and targets through jobs with stages for extraction, transformation and loading.
Data mining-2
The document discusses data mining primitives, languages, and system architectures. It introduces key concepts like data mining tasks, knowledge types, interestingness measures, and presentation formats. It also presents DMQL, a data mining query language that allows mining different knowledge types from relational databases and data warehouses. Finally, it outlines four architectures for data mining systems - no coupling, loose coupling, semi-tight coupling, and tight coupling with database and data warehouse systems.
dbms-1.pptx
The document provides an overview of database systems and their components. It discusses the purpose of database systems in addressing issues with file-based data storage like data redundancy, integrity problems, and concurrent access. It also describes the major components of a database system including the data models, data definition and manipulation languages, transaction management, storage management, database administrators, and users. The relational and entity-relationship models are explained as examples of common data models.
data generalization and summarization
This document discusses data generalization and summarization techniques. It describes how attribute-oriented induction generalizes data from low to high conceptual levels by examining attribute values. The number of distinct values for each attribute is considered, and attributes may be removed, generalized up concept hierarchies, or retained in the generalized relation. An algorithm for attribute-oriented induction takes a relational database and data mining query as input and outputs a generalized relation. Generalized data can be presented as crosstabs, bar charts, or pie charts.
Chapter 02-logistic regression
Logistic Regresson is a bell weather binary classifier. This chapter shows how to use Logistic Regression. The separation boundary for Logistic is linear. Discriminative Classifier. Probabilistic Classifier.
Performance analysis of machine learning algorithms on self localization system1
Random Forest algorithm provided the best prediction accuracy compared to other algorithms like Decision Tree Classifier, K-Neighbors Classifier, SVM, Naive Bayes, Bagging Classifier, AdaBoost Classifier, and MLP Classifier. All the algorithms generated models from the training dataset and new data was applied to the trained models to predict the class. Random Forest algorithm achieved a prediction accuracy of 98.62% on the test data, which was higher than other algorithms.
Data mining approaches and methods
This slide is about the data mining tasks and techniques.This slide consist of all the major mining task algorithms with their respective examples.
Presentation on Text Classification
This document discusses using support vector machines (SVMs) for text classification. It begins by outlining the importance and applications of automated text classification. The objective is then stated as creating an efficient SVM model for text categorization and measuring its performance. Common text classification methods like Naive Bayes, k-Nearest Neighbors, and SVMs are introduced. The document then provides examples of different types of text classification labels and decisions involved. It proceeds to explain decision tree models, Naive Bayes algorithms, and the main ideas behind SVMs. The methodology section outlines the preprocessing, feature selection, and performance measurement steps involved in building an SVM text classification model in R.
IRJET- Multi Label Document Classification Approach using Machine Learning Te...
This document discusses multi-label document classification approaches using machine learning techniques. It first provides background on multi-label classification and surveys several existing methods. These include transductive multi-label learning via label set propagation, classifier chains for multi-label classification, and multilabel neural networks. It also discusses random k-label sets and graph-based substructure pattern mining techniques. The document then proposes a new multi-label classification system that uses machine learning algorithms with semi-supervised learning and assigns weights to labels during testing to classify instances. Finally, it concludes that existing methods have issues like high computational complexity and missing data that the proposed approach aims to address.
Similar to DMQL(Data Mining Query Language).pptx (20)
Data mining-primitives-languages-and-system-architectures2641
Data mining-primitives-languages-and-system-architectures2641
Performance analysis of machine learning algorithms on self localization system1
Performance analysis of machine learning algorithms on self localization system1
Performance analysis of machine learning algorithms on self localization system1
Performance analysis of machine learning algorithms on self localization system1
IRJET- Multi Label Document Classification Approach using Machine Learning Te...
IRJET- Multi Label Document Classification Approach using Machine Learning Te...
More from Dr. Jasmine Beulah Gnanadurai
Data Warehouse_Architecture.pptx
The document discusses key concepts in data warehouse architecture including:
1) The functions of data warehouse tools which extract, clean, transform, load, and refresh data from source systems.
2) Key terminologies like metadata, which provides information about the data warehouse contents, and dimensional modeling using facts, dimensions, and data cubes.
3) Common multidimensional data models like star schemas with a central fact table linked to dimension tables and snowflake schemas which further normalize dimension tables.
Stacks.pptx
This document discusses stacks and queues as data structures. It begins with an overview of stacks, including their definition as a last-in, first-out abstract data type and common stack operations. Array implementation of stacks is described through examples of push and pop operations. The document also covers applications of stacks and different notation styles for arithmetic expressions. Next, queues are introduced as first-in, first-out data structures, with details on their array representation and operations like enqueue and dequeue. Implementation of queues using arrays and handling overflow/underflow conditions are explained.
Quick Sort.pptx
Quicksort is a widely used sorting algorithm that follows the divide and conquer paradigm. It works by recursively choosing a pivot element in an array, partitioning the array such that all elements less than the pivot come before all elements greater than the pivot, and then applying the same approach recursively to the sub-arrays. This has the effect of sorting the array in place with each iteration reducing the problem size until the entire array is sorted. The document provides pseudocode to implement quicksort and explains the algorithm at a high level.
KBS Architecture.pptx
This document discusses the architecture of knowledge-based systems (KBS). It explains that a KBS contains a knowledge module called the knowledge base (KB) and a control module called the inference engine. The KB explicitly represents knowledge that can be easily updated by domain experts without programming expertise. A knowledge engineer acts as a liaison between domain experts and the computer implementation. Propositional logic is then introduced as a basic technique for representing knowledge in KBS. It represents statements as atomic or compound propositions connected by logical operators like negation, conjunction, disjunction, implication, and biconditional.
Knowledge Representation in AI.pptx
Knowledge representation techniques are used to store knowledge in artificial intelligence systems so they can understand the world and solve complex problems. There are several common techniques, including logic, rules, semantic networks, frames, and scripts. Ontological engineering is used to develop large, modular ontologies that represent complex domains and allow knowledge to be integrated and combined. For knowledge representation systems to be effective, they must adequately and efficiently represent, store, manipulate, and acquire new knowledge.
File allocation methods (1)
The document discusses various file allocation methods and disk scheduling algorithms. There are three main file allocation methods - contiguous allocation, linked allocation, and indexed allocation. Contiguous allocation suffers from fragmentation but allows fast sequential access. Linked allocation does not have external fragmentation but is slower. Indexed allocation supports direct access but has higher overhead. For disk scheduling, algorithms like FCFS, SSTF, SCAN, CSCAN, and LOOK are described. SSTF provides lowest seek time while SCAN and CSCAN have higher throughput but longer wait times.
Segmentation in operating systems
This document discusses segmentation in operating systems. Segmentation divides memory into variable-sized segments rather than fixed pages. Each process is divided into segments like the main program, functions, variables, etc. There are two types of segmentation: virtual memory segmentation which loads segments non-contiguously and simple segmentation which loads all segments together at once but non-contiguously in memory. Segmentation uses a segment table to map the two-part logical address to the single physical address through looking up the segment base address.
Mem mgt
This document discusses virtual memory and demand paging. It explains that virtual memory separates logical memory from physical memory, allowing for larger address spaces than physical memory. Demand paging brings pages into memory only when needed, reducing I/O and memory usage. When a page is accessed that is not in memory, a page fault occurs and the operating system handles bringing that page in from disk while selecting a page to replace using an algorithm like FIFO, LRU, or optimal.
Decision tree
A decision tree classifier is explained. Key points include:
- Nodes test attribute values, edges correspond to test outcomes, and leaves predict the class.
- Information gain measures how much a variable contributes to the classification.
- It is used to select the variable that best splits the data at each node, with the highest information gain splitting the root node.
- An example calculates information gain for road type, obstruction, and speed limit variables to classify car speed. Speed limit has the highest information gain of 1 and is used to build the decision tree.
Association rules apriori algorithm
The document discusses the Apriori algorithm for frequent itemset mining. It explains that the Apriori algorithm uses an iterative approach consisting of join and prune steps to discover frequent itemsets that occur together above a minimum support threshold. The algorithm first finds all frequent 1-itemsets, then generates and prunes longer candidate itemsets in each iteration until no further frequent itemsets are found.
Big data architecture
The document discusses the key components of a big data architecture. It describes how a big data architecture is needed to handle large volumes of data from multiple sources that is too large for traditional databases. The architecture ingests data from various sources, stores it, enables both batch and real-time analysis, and delivers business insights to users. It also provides examples of Flipkart's data platform which includes components like an ingestion system, batch/streaming processing, and a messaging queue.
Knowledge representation
This document provides an introduction to knowledge representation in artificial intelligence. It discusses how knowledge representation and reasoning forms the basis of intelligent behavior through computational means. The key types of knowledge that need to be represented are defined, including objects, events, facts, and meta-knowledge. Different types of knowledge such as declarative, procedural, structural and heuristic knowledge are explained. The importance of knowledge representation for modeling intelligent behavior in agents is highlighted. The requirements for effective knowledge representation including representational adequacy, inferential adequacy, inferential efficiency, and acquisitional efficiency are outlined. Propositional logic is introduced as the simplest form of logic using propositions.
Aritificial intelligence
Artificial intelligence (AI) is the simulation of human intelligence processes by machines, especially computer systems. Specific applications of AI include expert systems, natural language processing, speech recognition, and machine vision. The document discusses what intelligence and artificial intelligence are, provides definitions and examples of artificial intelligence, and explains how artificial intelligence works through machine learning algorithms. It also covers the goals, history, and advantages of artificial intelligence.
Java threads
This document discusses Java threads. It defines threads as portions of a program that can execute concurrently, allowing tasks to be performed in parallel like downloading a file while playing video. There are two main ways to create threads in Java: by extending the Thread class or implementing the Runnable interface. The life cycle of a thread involves states like ready, running, blocked, waiting, and dead. Thread priorities and scheduling determine which ready threads get processor time.
Java Applets
The document discusses Java applets including their architecture, lifecycle, and event handling mechanisms. It describes the four lifecycle methods - init(), start(), stop(), and destroy() - and how applets are initialized, started, painted, stopped, and destroyed. It also discusses how to pass parameters to applets and run applets using HTML or the appletviewer tool.
Stacks and Queue - Data Structures
The document discusses stacks and queues as abstract data types. It describes their basic operations and implementations using arrays. Stacks follow LIFO (last-in, first-out) order and can be used for applications like undo operations. Queues follow FIFO (first-in, first-out) order and can be used where ordering of elements is important, like in printing queues. The document also discusses infix, prefix and postfix notations for arithmetic expressions and provides an algorithm to convert infix to postfix notation using a stack. Finally, it describes different types of queues including linear and circular queues.
JavaScript Functions
JavaScript functions allow code to be reused and run when invoked. Functions are defined using the function keyword and name and can take parameters. To call a function, its name is written and the code inside will execute. Functions can return values and be invoked from events, code, or automatically. They allow code reuse and running code with different arguments to produce different results.
JavaScript Operators
The document discusses various JavaScript operators such as arithmetic, assignment, comparison, logical, and type operators. It provides code examples of using operators to assign values to variables, add and concatenate numbers and strings, compare values, and perform conditional logic. The document also covers JavaScript conditional statements including if/else and switch statements for executing different code blocks based on various conditions.
Css Text Formatting
This document discusses CSS text formatting properties including text color, alignment, decoration, transformation, indentation, letter spacing, and line height. It provides examples of how each property can be used by specifying the property name and value in a CSS style rule. For example, to center align text the text-align property is set to center. Various text formatting properties allow control over text color, positioning, effects, spacing, and other visual aspects through CSS.
CSS - Cascading Style Sheet
This document provides an overview of CSS (Cascading Style Sheets) including what CSS is, how to write CSS style rules, and the different ways to add CSS styles to a webpage. CSS is a styling language that tells browsers how to display elements on a webpage by allowing the setting of properties like color, font, margins etc. Style rules are written with a selector that specifies the HTML element and a declaration with a property and value to set the style. Styles can be added inline within an HTML element, internally within <style> tags in the head, or externally in a separate .css file linked via <link>.
More from Dr. Jasmine Beulah Gnanadurai (20)
Recently uploaded
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdanePengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Constructing Your Course Container for Effective Communication
Communicating effectively and consistently with students can help them feel at ease during their learning experience and provide the instructor with a communication trail to track the course's progress. This workshop will take you through constructing an engaging course container to facilitate effective communication.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
Event Link:- https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-mule-event-processing-models/
Agenda
● What is event processing in MuleSoft?
● Types of event processing models in Mule 4
● Distinction between the reactive, parallel, blocking & non-blocking processing
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shivani Yasaswi - https://www.linkedin.com/in/shivaniyasaswi/
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
Solutons Maths Escape Room Spatial .pptx
Solutions of Puzzles of Mathematics Escape Room Game in Spatial.io
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
Recently uploaded (20)
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Constructing Your Course Container for Effective Communication
Constructing Your Course Container for Effective Communication
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
IGCSE Biology Chapter 14- Reproduction in Plants.pdf
IGCSE Biology Chapter 14- Reproduction in Plants.pdf
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
B. Ed Syllabus for babasaheb ambedkar education university.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
DMQL(Data Mining Query Language).pptx
- 1. DMQL(Data Mining Query Language) Dr. G. Jasmine Beulah Assistant Professor, Dept. Computer Science, Kristu Jayanti College,Bengaluru.
- 2. Data Mining Query Language (DMQL) • The Data Mining Query Language (DMQL) was proposed by Han, Fu, Wang, et al. for the DBMiner data mining system. • The Data Mining Query Language is actually based on the Structured Query Language (SQL). • Data Mining Query Languages can be designed to support ad hoc and interactive data mining. This DMQL provides commands for specifying primitives. • The DMQL can work with databases and data warehouses as well. • DMQL can be used to define data mining tasks. Particularly we examine how to define data warehouses and data marts in DMQL.
- 3. Syntax for Task-Relevant Data Specification use database database_name or use data warehouse data_warehouse_name in relevance to att_or_dim_list from relation(s)/cube(s) [where condition] order by order_list group by grouping_list
- 4. Syntax for Specifying the Kind of Knowledge • Syntax for Characterization, Discrimination, Association, Classification, and Prediction. Characterization The syntax for characterization is − mine characteristics [as pattern_name] analyze {measure(s) } The analyze clause, specifies aggregate measures, such as count, sum, or count%. For example − Description describing customer purchasing habits. mine characteristics as customerPurchasing analyze count%
- 5. Discrimination mine comparison [as {pattern_name]} For {target_class } where {t arget_condition } {versus {contrast_class_i } where {contrast_condition_i}} analyze {measure(s) }
- 6. A user may define big spenders as customers who purchase items that cost $100 or more on an average; and budget spenders as customers who purchase items at less than $100 on an average. The mining of discriminant descriptions for customers from each of these categories can be specified in the DMQL as − mine comparison as purchaseGroups for bigSpenders where avg(I.price) ≥$100 versus budgetSpenders where avg(I.price)< $100 analyze count
- 7. Association The syntax for Association is− mine associations [ as {pattern_name} ] {matching {metapattern} } For Example − mine associations as buyingHabits matching P(X:customer,W) ^ Q(X,Y) ≥ buys(X,Z) where X is key of customer relation; P and Q are predicate variables; and W, Y, and Z are object variables.
- 8. Classification The syntax for Classification is − mine classification [as pattern_name] analyze classifying_attribute_or_dimension For example, to mine patterns, classifying customer credit rating where the classes are determined by the attribute credit_rating, and mine classification is determined as classifyCustomerCreditRating. analyze credit_rating
- 9. Prediction The syntax for prediction is − mine prediction [as pattern_name] analyze prediction_attribute_or_dimension {set {attribute_or_dimension_i= value_i}}
- 10. Syntax for Concept Hierarchy Specification To specify concept hierarchies, use the following syntax − use hierarchy <hierarchy> for <attribute_or_dimension>
- 11. define hierarchy time_hierarchy on date as [date,month quarter,year] - set-grouping hierarchies define hierarchy age_hierarchy for age on customer as level1: {young, middle_aged, senior} < level0: all level2: {20, ..., 39} < level1: young level3: {40, ..., 59} < level1: middle_aged level4: {60, ..., 89} < level1: senior -operation-derived hierarchies define hierarchy age_hierarchy for age on customer as {age_category(1), ..., age_category(5)} := cluster(default, age, 5) < all(age)
- 12. -rule-based hierarchies define hierarchy profit_margin_hierarchy on item as level_1: low_profit_margin < level_0: all if (price - cost)< $50 level_1: medium-profit_margin < level_0: all if ((price - cost) > $50) and ((price - cost) ≤ $250)) level_1: high_profit_margin < level_0: all