MTL782: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 4 | | credits = 4 | ||
| credit_structure = 3-0-2 | | credit_structure = 3-0-2 | ||
| pre_requisites = MTL342 | | pre_requisites = [[MTL342]] | ||
| overlaps = COL352 | | overlaps = [[COL352]] | ||
}} | }} | ||
== MTL782 : Data Mining == | == MTL782 : Data Mining == | ||
Introduction to Data Mining, Data Cleaning and transformation,Data synchronization with operational databases, Association rule mining, Sequence analysis, mining complex data, Classification, knowledge Extraction and prediction, LIFT charts and ROC curves, Bagging and Boosting, Clustering techniques and application, Parallel and distributed data mining systems, data cubes and other visualizations. MTL783 Theory of Computation 3 credits (3-0-0) Introduction to the Theory of Computation: Proof Techniques, Basic concepts of language, Grammar and Automata; Chomsky Hierarchy, Regular Languages, Finite automata, Equivalence, DFA and NFA, Minimization, Myhill-Nerode Theorem; Context Free Grammar, Pushdown Automata their equivalenece and Application, Properties of Context-Free Languages; Turing Machine, Recursive and Recursively Enumerable Languages; Undecidability, Rice's Theorem, Post's Correspondence Problem, Complexity Theory, Intractable Problems. | Introduction to Data Mining, Data Cleaning and transformation,Data synchronization with operational databases, Association rule mining, Sequence analysis, mining complex data, Classification, knowledge Extraction and prediction, LIFT charts and ROC curves, Bagging and Boosting, Clustering techniques and application, Parallel and distributed data mining systems, data cubes and other visualizations. [[MTL783]] Theory of Computation 3 credits (3-0-0) Introduction to the Theory of Computation: Proof Techniques, Basic concepts of language, Grammar and Automata; Chomsky Hierarchy, Regular Languages, Finite automata, Equivalence, DFA and NFA, Minimization, Myhill-Nerode Theorem; Context Free Grammar, Pushdown Automata their equivalenece and Application, Properties of Context-Free Languages; Turing Machine, Recursive and Recursively Enumerable Languages; Undecidability, Rice's Theorem, Post's Correspondence Problem, Complexity Theory, Intractable Problems. | ||
Latest revision as of 16:43, 14 April 2026
| MTL782 | |
|---|---|
| Data Mining | |
| Credits | 4 |
| Structure | 3-0-2 |
| Pre-requisites | MTL342 |
| Overlaps | COL352 |
MTL782 : Data Mining
Introduction to Data Mining, Data Cleaning and transformation,Data synchronization with operational databases, Association rule mining, Sequence analysis, mining complex data, Classification, knowledge Extraction and prediction, LIFT charts and ROC curves, Bagging and Boosting, Clustering techniques and application, Parallel and distributed data mining systems, data cubes and other visualizations. MTL783 Theory of Computation 3 credits (3-0-0) Introduction to the Theory of Computation: Proof Techniques, Basic concepts of language, Grammar and Automata; Chomsky Hierarchy, Regular Languages, Finite automata, Equivalence, DFA and NFA, Minimization, Myhill-Nerode Theorem; Context Free Grammar, Pushdown Automata their equivalenece and Application, Properties of Context-Free Languages; Turing Machine, Recursive and Recursively Enumerable Languages; Undecidability, Rice's Theorem, Post's Correspondence Problem, Complexity Theory, Intractable Problems.