Skip to main content

Machine Learning Notes( JNTUK MTech CSE)


SYLLABUS

Unit I: Introduction: Towards Intelligent Machines Well posed Problems, Example of Applications in diverse fields, Data Representation, Domain Knowledge for Productive use of Machine Learning, Diversity of Data: Structured / Unstructured, Forms of Learning, Machine Learning and Data Mining, Basic Linear Algebra in Machine Learning Techniques.

 Unit II: Supervised Learning: Rationale and Basics: Learning from Observations, Bias and Why Learning Works: Computational Learning Theory, Occam's Razor Principle and Over fitting Avoidance Heuristic Search in inductive Learning, Estimating Generalization Errors, Metrics for assessing regression, Metris for assessing classification. 

Unit III: Statistical Learning: Machine Learning and Inferential Statistical Analysis, Descriptive Statistics in learning techniques, Bayesian Reasoning: A probabilistic approach to inference, K-Nearest Neighbor Classifier. Discriminant functions and regression functions, Linear Regression with Least Square Error Criterion, Logistic Regression for Classification Tasks, Fisher's Linear Discriminant and Thresholding for Classification, Minimum Description Length Principle. 

Unit IV: Support Vector Machines (SVM): Introduction, Linear Discriminant Functions for Binary Classification, Perceptron Algorithm, Large Margin Classifier for linearly seperable data, Linear Soft Margin Classifier for Overlapping Classes, Kernel Induced Feature Spaces, Nonlinear Classifier, and Regression by Support vector Machines. Learning with Neural Networks: Towards Cognitive Machine, Neuron Models, Network Architectures, Perceptrons, Linear neuron and the Widrow-Hoff Learning Rule, The error correction delta rule. 

Unit V: Multilayer Perceptron Networks and error back propagation algorithm, Radial Basis Functions Networks. Decision Tree Learning: Introduction, Example of classification decision tree, measures of impurity for evaluating splits in decision trees, ID3, C4.5, and CART decision trees, pruning the tree, strengths and weakness of decision tree approach.





                                                                                   Next        

Comments

Popular posts from this blog

Informatics Practices (2024-25) CLASS XI Code No. 065 Syllabus

Informatics Practices (2024-25)  CLASS XI Code No. 065 Unit 1: Introduction to Computer System  Introduction to computer and computing:  evolution of computing devices, components of a computer system and their interconnections, Input/output devices. Computer Memory: Units of memory, types of memory – primary and secondary, data deletion, its recovery and related security concerns. Software: purpose and types – system and application software, generic and specific purpose software. Unit 2: Introduction to Python Basics of Python programming, execution modes: - interactive and script mode, the structure of a program, indentation, identifiers, keywords, constants, variables, types of operator, precedence of operators, data types, mutable and immutable data types, statements, expression evaluation. comments, input and output statements, data type conversion, debugging. Control Statements: if-else, if-elif-else, while loop, for loop  Lists: list operations - creating, in...

Computer Science (2024-25) CLASS XI Code No. 083 Syllabus

 Computer Science (2024-25) CLASS XI Code No. 083 Unit 1: Computer Systems and Organisation ● Basic computer organisation: Introduction to Computer System, hardware, software, input device, output device, CPU, memory (primary, cache and secondary), units of memory (bit, byte, KB, MB, GB, TB, PB) ● Types of software: System software (Operating systems, system utilities, device drivers), programming tools and language translators (assembler, compiler, and interpreter), application software ● Operating System(OS): functions of the operating system, OS user interface ● Boolean logic: NOT, AND, OR, NAND, NOR, XOR, NOT, truth tables and De Morgan’s laws, Logic circuits ● Number System: Binary, Octal, Decimal and Hexadecimal number system;conversion between number systems ● Encoding Schemes: ASCII, ISCII, and Unicode (UTF8, UTF32) ● Introduction to Problem-solving: Steps for Problem-solving (Analyzing the problem, developing an algorithm, coding, testing, and debugging), rep...

Social Network Analysis Syllabus (JNTUK)

UNIT I: Social Network Analysis: Preliminaries and definitions, Erdos Number Project, Centrality measures, Balance and Homophily. UNIT II: Random graph models: Random graphs and alternative models, Models of network growth, Navigation in social Networks, Cohesive subgroups, Multidimensional Scaling, Structural equivalence, roles, and positions. UNIT III: Network topology and diffusion, Contagion in Networks, Complex contagion, Percolation and information, Navigation in Networks Revisited. UNIT IV: Small world experiments, small world models, origins of small world, Heavy tails, Small Diameter, Clustering of connectivity, The ErdosRenyi Model, Clustering Models. UNIT V: Network structure -Important vertices and page rank algorithm, towards rational dynamics in networks, basics of game theory, Coloring and consensus, biased voting, network formation games, network structure and equilibrium, behavioral experiments, Spatial and agent-based models.