R18 B.Tech. CSE Syllabus JNTU HYDERABAD ‘*MCS10: INTELLECTUAL PROPERTY RIGHTS Ill Year B.Tech. CSE I-Sem e4 ov 20 UNIT -1 Introduction to Intellectual property: Introduction, types of intellectual property, international organizations, agencies and treaties, importance of intellectual property rights. UNIT 11 ‘Trade Marks: Purpose and function of trademarks, acquisition of trade mark rights, protectable matter, selecting, and evaluating trade mark, trade mark registration processes. UNIT — 1H Law of copy rights: Fundamental of copy right law, originality of material, rights of reproduction, rights to perform the work publicly, copy right ownership issues, copy right registration, notice of copy right, international copy right law. Law of patents: Foundation of patent law, patent searching process, ownership rights and transfer UNIT ~1V Trade Secrets: Trade secrete law, determination of trade secrete status, liability for misappropriations of trade secrets, protection for submission, trade secrete litigation. Unfair competition: Misappropriation right of publicity, false advertising, UNIT-Vv New development of intellectual property: new developments in trade mark law; copy right law, patent law, intellectual property audits. International overview on intellectual property, intemational — trade mark law, copy right law, international patent law, and international development in trade secrets law. ‘TEXT & REFERENCE BOOKS: 1. Intellectual property right, Deborah. E. Bouchoux, Cengage learning. 2. Intellectual property right — Unleashing the knowledge economy, prabuddha ganguli, Tata McGraw Hill Publishing company Itd 96R18 B.Tech. CSE Syllabus JNTU HYDERABAD CS601PC: MACHINE LEARNING Ill Year B.Tech. CSE II-Sem a4 ev ao Prerequisites 4, Data Structures 2. Knowledge on statistical methods Course Objectives ‘+ This course explains machine leaming techniques such as decision tree learning, Bayesian learning etc. ‘+ To understand computational learning theory. * To study the pattern comparison techniques. Course Outcomes ‘+ Understand the concepts of computational intelligence like machine learning ‘+ Ability to get the skill to apply machine leaming techniques to address the real time problems in diferent areas ‘+ Understand the Neural Networks and its usage in machine learning application. UNIT «1 Introduction - Well-posed learning problems, designing a learning system, Perspectives and issues in machine learning Concept learning and the general to specific ordering — introduction, a concept learning task, concept learning as search, find-S: finding a maximally specific hypothesis, version spaces and the candidate ‘elimination algorithm, remarks on version spaces and candidate elimination, inductive bias. Decision Tree Learning — Introduction, decision tree representation, appropriate problems for decision tree learning, the basic decision tree learning algorithm, hypothesis space search in decision tree learning, inductive bias in decision tree learning, issues in decision tree learning, UNIT -IL Artificial Neural Networks-1- Introduction, neural network representation, appropriate problems for neural network leaming, perceptions, multilayer networks and the back-propagation algorithm, Artificial Neural Networks-2- Remarks on the Back-Propagation algorithm, An illustrative example: face recognition, advanced topics in artificial neural networks. Evaluation Hypotheses ~ Motivation, estimation hypothesis accuracy, basics of sampling theory, a general approach for deriving confidence intervals, difference in error of two hypotheses, comparing leaming algorithms. UNIT - I Bayesian learning — Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum Likelihood and least squared error hypotheses, maximum likelihood hypotheses for predicting probabilities, minimum description length principle, Bayes optimal classifier, Gibs algorithm, Naive Bayes classifier, an example: leaming to classify text, Bayesian belief networks, the EM algorithm Computational learning theory ~ Introduction, probably learning an approximately correct hypothesis, sample complexity for finite hypothesis space, sample complexity for infinite hypothesis spaces, the mistake bound model of learning. Instance-Based Learning- Introduction, k-nearest neighbour algorithm, locally weighted regression, radial basis functions, case-based reasoning, remarks on lazy and eager learning, 7R18 B.Tech. CSE Syllabus JNTU HYDERABAD UNIT-1V Genetic Algorithms — Motivation, Genetic algorithms, an illustrative example, hypothesis. space search, genetic programming, models of evolution and learning, parallelizing genetic algorithms. Learning Sets of Rules — Introduction, sequential covering algorithms, learning rule sets: summary, learning First-Order rules, learning sets of First-Order rules: FOIL, Induction as inverted deduction, inverting resolution. Reinforcement Learning ~ Introduction, the learning task, Q-learning, non-deterministic, rewards and actions, temporal difference leaming, generalizing from examples, relationship to dynamic programming. UNIT -v Analytical Learning-1- Introduction, learning with perfect domain theories: PROLOG-EBG, remarks ‘on explanation-based learning, explanation-based learning of search control knowledge. Analytical Learning-2-Using prior knowledge to alter the search objective, using prior knowledge to ‘augment search operators. Combining Inductive and Analytical Learning - Motivation, inductive-analytical approaches to leaming, using prior knowledge to initialize the hypothesis. TEXT BOOK: 4. Machine Learning - Tom M. Mitchell, - MGH REFERENCE BOOK: 1, Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis 98