SEMANTIC WEB ANDSOCIAL NETWORKS Syllabus

-

 

SEMANTIC WEB AND SOCIAL NETWORKS

 

L

T

P

C

3

0

0

3

 
 
B. Tech IV Year II Semester- IT Course Code: A58580

Course Outcomes:

1.    Identify the Structure of the Semantic Web Technology in reference with the World Wide Web.

2.    Design the concepts of Resource Description Framework, Ontology and Web Ontology Language (OWL).

3.    Understand Ontology Engineering Tools and Methods.

4.    Apply Logic, Rule and Inference Engines in Semantic Applications.

5.    Understand and Analyze Social Networks and design solution for Web based Social Networks like Blogs and Online Communities.

UNIT-I

Empowering the Information Age :

Thinking and Intelligent Web Applications, The Information Age, The World Wide Web,

Limitations of Today’s Web, The Next Generation Web.

Turing: What is Machine Intelligence? :

Machine Intelligence, Artificial Intelligence, Ontology, Inference engines, Software Agents.

Berners-Lee: What is Solvable on the Web? :

Berners-Lee www, Semantic Road Map, Logic on the semantic Web.

UNIT-II

Resource Description Framework:

HTML Language, XML Language,RDF Language,Basic Elements, RDF Schema.

Web Ontology Language:

Ontology Language,Ontology Language Requirements, Compatibility of OWL and RDF/RDFS, The OWL Language, Basic Elements, OWL Example: Compute Ontology,OWL Capabilities and Limitations.

UNIT-III

Ontology Engineering:

Ontology Engineering, Constructing Ontology, Ontology Development Tools, Ontology Methods, Ontology Sharing and Merging, Ontology Libraries and Ontology Mapping.

UNIT-IV

Logic, Rules, Inference & Semantic Web Applications:

Logic, Rule and Inference, Semantic Web applications and services, Semantic Search, e- learning, Semantic Bioinformatics, Knowledge Base.

Semantic Search Technology:

Search Engines, Semantic Search, Semantic Search Technology, Web Search Agents, Semantic Methods.

UNIT-V

Social Network Analysis:

What is Networks analysis, Development of the social networks analysis.

Electronic sources for network analysis:

Electronic Discussion networks. Blogs and Online Communities, Web Based Networks. Developing social-semantic applications: Building Semantic Web Applications with social network features, Semantic Web Architecture.

Text Books:

1.    Thinking on the Web Berners Lee, Godel and Turing, Wiley inter science, 2008.

2.    Social Networks and the Semantic Web, Peter Mika, Springer, 2007.

Reference Books:

1.    Semantic Web Technologies, Trends and Research in Ontology Based Systems, J.Davies, Audi Studer, Paul Warren, John Wiley & Sons.

2.    Semantic Web and Semantic Web Services Liyang Lu Chapman and Hall/CRC Publishers,(Taylor & Francis Group)

3.    Information sharing on the semantic Web Heiner Stucken schmidt; Frank Van Harmelen, Springer Publications.

 

Click Here 👉Syllabus PPT:


Click Here 👉Syallbus PDF:

Comments

Post a Comment

Popular posts from this blog

Machine Learning 1: UNIT 3 : Support Vector Machines MCQs

-
UNIT 3 Support Vector Machines MCQs  ----------------------------------------------------------------------------------------------------------------------------- 1. A Support Vector Machine can be used for A.     Performing linear or nonlinear classification B.     Performing regression C.     For outlier detection D.     All of the above Ans: D 2. The decision boundaries in a Support Vector machine is fully determined (or “supported”) by the instances located on the edge of the street? Top of Form True False Ans: A 3. Support Vector Machines are not sensitive to feature scaling A.     Top of Form True False Ans: B 4. If we strictly impose that all instances be off the street and on the right side, this is called  Soft margin classification  Hard margin classification  Strict margin classification  Loose margin classification Ans...
Machine Learning

VERSION SPACES AND THE CANDIDATE-ELIMINATION ALGORITHM

-
Image
  VERSION SPACES AND THE CANDIDATE-ELIMINATION ALGORITHM   •         The key idea in the CANDIDATE-ELIMINATION algorithm is to output •         a description of the set of all hypotheses consistent with the training examples Note difference between definitions of consistent and satisfies ·        An example x is said to satisfy hypothesis h when h(x) = 1, regardless of whether x is a positive or negative example of the target concept . ·        An example x is said to consistent with hypothesis h iff h(x) = c(x) The LIST-THEN-ELIMINATION algorithm The LIST-THEN-ELIMINATE algorithm first initializes the version space to contain all hypotheses in H and then eliminates any hypothesis found inconsistent with any training example . ___________________________________________________________________________ 1. VersionSpace c...
Machine Learning

Machine Learning MCQs-2 (Performance Metrics, Linear Regression, Naïve Bayes Classifier )

-
                               Machine Learning MCQs- 2 Performance Metrics, Linear Regression, Naïve Bayes Classifier  1.   The greater the value for ROC AUC, better the model: True False Ans: 1   2.   A set of data are all close to each other, and they are close to the actual value.  This set of data can be described as... Accurate Precise both Precise and accurate None of the above Ans: 3 3. The maximum value of the ROC AUC is: 0.8 0.9 1 0 Ans: 3 4. Recall can be increased by increasing the decision threshold. True or False? True False Ans: 2 5. Which of these is a good measure to decide which threshold to use? Confusion matrix F1 score ROC curve Precision & Recall versus Threshold Curve Ans: 4 6.  Which of these may have to be performed before analyzing and training the dataset? Shuffling Cross-Validation F1 Score None Ans: 1 7. For the below confusio...
Machine Learning