SEMANTIC WEB AND SOCIAL NETWORKS UNIT - 4

1. SEMANTIC WEB AND SOCIAL NETWORKS UNIT - 4

2. XML-BASED WEBSERVICES • WebServices providea between standardmeansof differentsoftware interoperating applications running on a variety of platforms. • The XML provides the extensibility and language neutrality that is the key for standard-based interoperability of Web Services. • Web Service Architecture requires discrete software agents that must work together to implement functionality.

3. Web Service discovery and composition is led by Universal Description Discovery and Integration (UDDI) developed by IBM and Microsoft. Well accepted standards like Web Services Description Language (WSDL) for binding and • Simple Object Access Protocol (SOAP) for messaging make it possible to dynamically invoke Web services. • In order for this message exchange to be successful, the requester and the provider must first agree on both the semantics and the mechanics of the message exchange.

4. CREATING AN OWL-S ONTOLOGY FOR WEB SERVICES • Creating an OWL-S based Ontology for a Web Service requires five steps: • Describe individual programs: describe the individual programs that comprise the service. The process model provides a declarative description of a program’s properties. • Describe the grounding for each atomic process: relate each atom

5. Describe compositions of the atomic processes: describe the composite process that is a composition of its atomic processes. • Describe a simple process: describe a simple process for the service(optional). • Profile description: provide a declarative advertisement for the service. It is partially populated by the process model.

6. SEMANTIC SEARCHTECHNOLOGY • SEARCH ENGINES • Commercial search engines are based upon one of two forms of Web search technologies: human directed search and automated search. • The human directed search engine technology utilizes a database of keywords,concepts, and references. • The fully automated form of Web search technology is based upon the Webcrawler, spider, robot (bot), or agent, which follows HyperText Transfer Protocol.

7. Ranking and Relevancy • In ranking Web pages, search engines follow a certain set of rules. Their goal,of course, is to return the most relevant pages at the top of their lists. • Todothis,theylookforthelocationand frequency of keywords and phrases in the Web • Page document There are three necessary criteria: • maximum relevant information;(2) minimum irrelevant information; and (3) meaningful ranking, with the most relevant results first.

8. Google Search Algorithm • The heart of Google search software is PageRank, a system for rankingWeb pages developed by the founders Larry Page and Sergey Brin at Stanford University. • Google’s PageRank Algorithm. The PageRank algorithm is calculated as follows: • PR(A)=(1− d)+d[PR(T1)/C(T1)+·· • ·+PR(Tn)/C(Tn)]

9. where, • PR(A) is the PageRank of a page A PR(T1) is the PageRank of a page T1 • C(T1) is the number of outgoing links from the page T1 • d is a damping factor in the range 0 < d < 1, usually set to 0.85 • The PageRank of a Web page is therefore calculated as a sum of the PageRanks of all pages linking to it (its incoming links), divided by the number of links on each of those pages (its outgoing links).

10. SEMANTIC SEARCH • Semanticsearchseekstofinddocumentsthat have similar concepts, not just similar words. • Therearetwoapproachestoimprovingsearch results Semantic through Indexing semanticmethods:Latent andSemanticWeb • Documents. • LSI, which is an information retrieval method that organizes existing HTML information into a semantic structure that takes advantage of some of the implicit higher order associations of words with text objects.

11. The LSI offers an application method that can be implemented immediately with existing Web documentation. • One of the first and the most popular of these search engines is Cycorp.Cyc combines the world’s largest knowledge base with the Web. • Cyc is an immense,multi-contextual knowledge based. • With Cyc Knowledge Server it is possible for Web sites to add common-sense intelligence and distinguish different meanings of ambiguous concepts.

12. SEMANTIC SEARCH TECHNOLOGY • Searching Techniques • Semantic search deals with concepts and logical relationships. • Search tree faces an incompleteness of logic resulting in the Incompleteness Problem, or the Halting Problem. • The importance of the Halting Problem lies in the fact that it was the first problem to be proved undecidable. • The Halting Problem implies that certain algorithms will never end in a definite answer.

13. You run into incompleteness because the search tree is too large. So our approach must be to search only portions of the tree. There are well- known strategies for how one addresses search problems like this. One strategy is to search the tree in a depth-first fashion. • A depth-first search would start at the top of the tree and go as deeply as possible down some path, expanding nodes as you go, until you find a dead end. • The advantage of depth-first search is that it is a very algorithmically efficient way to search trees in one format.

14. It limits the amount of space that you have to keep for remembering the things you have not looked at yet. All you have to remember is the path back up. • The disadvantage with depth-first search is that once you get started down some path, you have to trace it all the way to the end. • Another strategy for searching is a breadth-first search. Here you search layer by layer. • The advantage of breadth-first search is that you are guaranteed to get the simplest proofs before you get anything that is strictly more complicated.

15. There are two basic classes of search algorithms used to attempt to overcome the incompleteness and halting limitations: uninformed and informed. • Uninformed, or blind, searches are those that have no information about the number of steps or the path cost from the current state to the goal. • These searches include : depth-first, breadth-first, uniform-cost,depth-limiting, anditerative orheuristic, deepeningsearch.Informed, searches are those that have information about the goal; this information is usually either an estimated path cost to it or estimated number of steps away from it.

16. WEB SEARCHAGENTS • The agent’s actions are to determine if its goal of seeking a Web site containing a specified target (e.g., keyword or phrase), has been met and if not, find other locations to visit. • What makes the agent intelligent is its ability to make a rational decision when given a choice. In other words, given a goal, it will make decisions to follow the course of actions that would lead it to that goal in a timely manner.

17. Building an intelligent Web search agent requires mechanisms for multiple and combinational keyword searches, exclusion handling, and the ability to self-seed when it exhausts a search space. • The search agent needs to know the target (i.e., keyword or phrase), where to start, how many iterations of the target to find how long to look (time constraint), and what methods should determine criteria for choosing paths (search methods). These issues are addressed in the software.

18. The Web search agent design consists of four main phases: initialization, perception, action, and effect. • In the initialization phase, the Web search agent should set up all variables, structures, and arrays. • The perception phase is centered on using the knowledge provided to contact a site and retrieve the information from that location. • The action phase takes all of the information that the system knows and determines if the goal has been met

19. SEMANTICMETHODS • Semantic search methods augment and improve traditional search results by using not just words, but meaningful concepts. • There are two approaches to improving search results through semantic methods: (1) LSI and (2) SemanticWeb documents. • LATENT SEMANTIC INDEX SEARCH • Latent semantic indexing adds an important step to the document indexing process.

20. In addition to recording which keywords a document contains, the method examines the document collection as a whole, to see which other documents contain some of those same words. • LSI algorithm does not understand anything what the words mean, it notices the patterns. • Searching for Content • A semantic search engine is a remarkably useful solution. It can discover if two documents are similar even if they do not have any specific words in common and it can reject documents that share only uninteresting words in common.

21. Stem :To obtain semantic content from a document, first make a complete list of all the words that appear in the collection and then stem them as follows: discard articles, prepositions, and conjunctions; discard common verbs (know, see, do, be); discard pronouns; discard common adjectives (big, late, high); discard frilly words (therefore, thus, however, albeit, etc.); discard any words that appear in every document; and discard any words that appear in only one document.

22. The implementation algorithm follows: For each document: • (1) Stem all of the words and throw away any common • ‘noise’ words. • (2) For each of the remaining words, visit and remember each document that has a direct relationship to this word. • (3) For each of the as-of-yet-unvisited new related documents now being tracked. Recursively perform the same operation as above. • The word stemming process gets rid of common words, such as “the” and “etc.”

23. TAP: An example of semantic search technology is TAP. • TAP leverages automated and semiautomated techniques to extract knowledge bases from unstructured and semistructured bodies of text. • In TAP, existing documents are analyzed using semantic techniques and converted into Semantic Web documents using automated techniques or manually by the document author using standard word processing packages.

24. SWOOGLE • “Swoogle” is a crawler-based indexing and retrieval system for Semantic Web documents using RDF and OWL. • Swoogle helps users integrate Semantic Web data distributed on the Web. • Swoogle is designed to scale up to handle millions of documents and enables rich query constraints on semantic relations. • Swoogle architecture can be broken into four major components:

25. SWD discovery, metadata creation, data analysis, and interface. These components work independently and interact with one another through a database. • The Swoogle algorithm, Ontology Rank, was inspired by Google’s Page Rank algorithm and is used to rank search results. • Given SWDs A and B, Swoogle classifies inter- SWD links into four categories: • Imports (A,B): A imports all content of B. • Uses-term (A,B): A uses some of terms defined by B without importing B.

26. Social NetworkAnalysis • Social Network Analysis (SNA) is the study of social relations among a set of actors. • The key difference between network analysis and other approaches to social science is the focus on relationships between actors rather than the attributes of individual actors. • The patterns of relationships may not only be used to explain individual performance but also to hypothesize their impact on the network itself.

27. When trying to predict the performance of individuals in a scientific community by some measure (say, number of publications), a traditional social science approach would dictate to look at the attributes of the researchers such as the amount of grants they attract, their age, the size of the team they belong to etc. • SNA is thus a different approach to social phenomena and therefore requires a new set of concepts and new methods for data collection and analysis.

28. Development of Social Network Analysis • The field of Social Network Analysis today is the result of the convergence of several streams of applied research in sociology, social psychology and anthropology. • Harvard looked at the workgroup behavior (communication,friendships,helping,controversy) at a specific part of the factory, the bank wiring room. • They also went further than the Hawthorne study in generating hypotheses about the possible connections between cliques.

29. Theynoted that lower-class members of a clique are usually only able to connect to higher-class members of another clique through the higher- class members of their own clique. • The term “social network” has been introduced by Barnes in 1954. Moreno called a sociogram was a visual representation of social networks as a set of nodes connected by directed links. • The vocabulary, models and methods of network analysis also expand continuously through applications that require to handle ever more complex data sets.

30. Figure 2.1. Illustrations froman early social network study at the Hawthorne works Electric in Chicago. The upper part shows the location of the workers in the wiring room, while the lower part is a network image of fights about the windows between workers (W), solderers (S) and inspectors (I).

31. Two developments in the last two decades that led to an explosion in network literature. • First, advances in information technology brought a wealth of electronic data and significantly increased analytical power. • Second, the methods of SNA are increasingly applied to networks other than social networks such as the hyperlink structure on the Web or the electric grid.

32. Electronic sources for networkanalysis • First, social networks have been studied by observation. The disadvantage of this method is the close involvement of the researcher in the process of data collection. • Data collection using manual methods are extremely labor intensive and can take up to fifty per cent of the time and resources of a project in network analysis. • A creative solution to the problem of data collection is to reuse existing electronic records of social interaction that were not created for the purposes of network analysis on the first place

33. However, there is one data source that is not only vast, diverse and dynamic but also free for all: the Internet. • Electronic discussion networks • Tyler, Wilkinson and Huberman analyze communication among employees of their own lab by using the corporate email archive. if they had exchanged at least a minimum number of total emails in a given period, filtering out one- way relationships. • Adamic and Adar revisits one of the oldest problems of network research, namely the question of local search.

34. How do people find short paths in social networks based on only local information about their immediate contacts? • Their findings support earlier results that additional knowledge on contacts such as their physical location and position in the organization allows employees to conduct their search much more efficiently than using the simple strategy of always passing the message to the most connected neighbor. • Discussion are largely in email and to a smaller part on the phone and in face-to-face meetings.

35. Group communication and collective decision taking in various settings are traditionally studied using much more limited written information such as transcripts and records of attendance and voting. • The main technical contribution of Gloor is a dynamic visualization of the discussion network that allows to quickly identify the moments when key discussions take place that activate the entire group and not just a few select members. • Gloor also performs a comparative study across the various groups based on the structures that emerge over time.

36. Extends (A,B): A extends the definitions of terms defined by B. • Asserts (A,B): A makes assertions about the individuals defined by B. • Currently, the most popular kinds of documents are Friend of a friend (FOAF) files and RSS files. • Swoogle is intended to support services needed by software agents and programs via web service interfaces. • Using Swoogle, one can find all of the Semantic Web documents that use a set of properties or classes.