Stop thinking , start tagging : tag semantics emerge from collaborative verbosity Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems . While several methods have been proposed , little is known about the factors that influence the evolution of semantic structures in these systems . A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging : Users with certain usage patterns might contribute more to the resulting semantics than others . In this work , we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures . We distinguish between categorizers , who typically use a small set of tags as a replacement for hierarchical classification schemes , and describers , who are annotating resources with a wealth of freely associated , descriptive keywords . To study our hypothesis , we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers . Our results not only show that `` verbose '' taggers are most useful for the emergence of tag semantics , but also that a subset containing only 40 % of the most ` verbose ' taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset . Moreover , the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics . This work is relevant for designers and analysts of tagging systems interested ( i ) in fostering the semantic development of their platforms , ( ii ) in identifying users introducing `` semantic noise '' , and ( iii ) in learning ontologies .

O O O O B O O B O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Crawling English-Japanese person-name transliterations from the web Automatic compilation of lexicon is a dream of lexicon compilers as well as lexicon users . This paper proposes a system that crawls English-Japanese person-name transliterations from the Web , which works a back-end collector for automatic compilation of bilingual person-name lexicon . Our crawler collected 561K transliterations in five months . From them , an English-Japanese person-name lexicon with 406K entries has been compiled by an automatic post processing . This lexicon is much larger than other similar resources including English-Japanese lexicon of HeiNER obtained from Wikipedia .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

automatic lexicon compilation
information search and retrieval
mining transliteration pairs
natural language processing
person name


Ranking refinement and its application to information retrieval We consider the problem of ranking refinement , i.e. , to improve the accuracy of an existing ranking function with a small set of labeled instances . We are , particularly , interested in learning a better ranking function using two complementary sources of information , ranking information given by the existing ranking function ( i.e. , a base ranker ) and that obtained from users ' feedbacks . This problem is very important in information retrieval where the feedback is gradually collected . The key challenge in combining the two sources of information arises from the fact that the ranking information presented by the base ranker tends to be imperfect and the ranking information obtained from users ' feedbacks tends to be noisy . We present a novel boosting framework for ranking refinement that can effectively leverage the uses of the two sources of information . Our empirical study shows that the proposed algorithm is effective for ranking refinement , and furthermore significantly outperforms the baseline algorithms that incorporate the outputs from the base ranker as an additional feature .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

background information
incremental learning
learning to rank


Einstein : physicist or vegetarian ? summarizing semantic type graphs for knowledge discovery The Web and , in particular , knowledge-sharing communities such as Wikipedia contain a huge amount of information encompassing disparate and diverse fields . Knowledge bases such as DBpedia or Yago represent the data in a concise and more structured way bearing the potential of bringing database tools to Web Search . The wealth of data , however , poses the challenge of how to retrieve important and valuable information , which is often intertwined with trivial and less important details . This calls for an efficient and automatic summarization method . In this demonstration proposal , we consider the novel problem of summarizing the information related to a given entity , like a person or an organization . To this end , we utilize the rich type graph that knowledge bases provide for each entity , and define the problem of selecting the best cost-restricted subset of types as summary with good coverage of salient properties . We propose a demonstration of our system which allows the user to specify the entity to summarize , an upper bound on the cost of the resulting summary , as well as to browse the knowledge base in a more simple and intuitive manner .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


The SOWES approach to P2P web search using semantic overlays Peer-to-peer ( P2P ) Web search has gained a lot of interest lately , due to the salient characteristics of P2P systems , namely scalability , fault-tolerance and load-balancing . However , the lack of global knowledge in a vast and dynamically evolving environment like the Web presents a grand challenge for organizing content and providing efficient searching . Semantic overlay networks ( SONs ) have been proposed as an approach to reduce cost and increase quality of results , and in this paper we present an unsupervised approach for distributed and decentralized SON construction , aiming to support efficient search mechanisms in unstructured P2P systems .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

content analysis and indexing
distributed and peer-to-peer search
information search and retrieval
miscellaneous


Automatic web service composition with abstraction and refinement The behavioral description based Web Service Composition ( WSC ) problem aims at the automatic construction of a coordinator web service that controls a set of web services to reach a goal state . However , solving the WSC problem exactly with a realistic model is doubly-exponential in the number of variables in web service descriptions . In this paper , we propose a novel efficient approximation-based algorithm using automatic abstraction and refinement to dramatically reduce the number of variables needed to solve the problem .

O O B I O B O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O

abstraction
refinement
service composition


How to make a semantic web browser Two important architectural choices underlie the success of the Web : numerous , independently operated servers speak a common protocol , and a single type of client the Web browser provides point-and-click access to the content and services on these decentralized servers . However , because HTML marries content and presentation into a single representation , end users are often stuck with inappropriate choices made by the Web site designer of how to work with and view the content . RDF metadata on the Semantic Web does not have this limitation : users can gain direct access to information and control over how it is presented . This principle forms the basis for our Semantic Web browser an end user application that automatically locates metadata and assembles point-and-click interfaces from a combination of relevant information , ontological specifications , and presentation knowledge , all described in RDF and retrieved dynamically from the Semantic Web . Because data and services are accessed directly through a standalone client and not through a central point of access ( e.g. , a portal ) , new content and services can be consumed as soon as they become available . In this way we take advantage of an important sociological force that encourages the production of new Semantic Web content while remaining faithful to the decentralized nature of the Web .

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

bioinformatics
design tools and techniques
user interface
web services


The XML web : a first study Although originally designed for large-scale electronic publishing , XML plays an increasingly important role in the exchange of data on the Web . In fact , it is expected that XML will become the lingua franca of the Web , eventually replacing HTML . Not surprisingly , there has been a great deal of interest on XML both in industry and in academia . Nevertheless , to date no comprehensive study on the XML Web ( i.e. , the subset of the Web made of XML documents only ) nor on its contents has been made . This paper is the first attempt at describing the XML Web and the documents contained in it . Our results are drawn from a sample of a repository of the publicly available XML documents on the Web , consisting of about 200,000 documents . Our results show that , despite its short history , XML already permeates the Web , both in terms of generic domains and geographically . Also , our results about the contents of the XML Web provide valuable input for the design of algorithms , tools and systems that use XML in one form or another .

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O

statistical analysis
structural properties


Debugging OWL ontologies As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated , finding the cause of errors becomes an extremely hard task even for experts . Existing ontology development environments provide some limited support , in conjunction with a reasoner , for detecting and diagnosing errors in OWL ontologies . Typically these are restricted to the mere detection of , for example , unsatisfiable concepts . We have integrated a number of simple debugging cues generated from our description logic reasoner , Pellet , in our hypertextual ontology development environment , Swoop . These cues , in conjunction with extensive undo\/redo and Annotea based collaboration support in Swoop , significantly improve the OWL debugging experience , and point the way to more general improvements in the presentation of an ontology to new users .

O B O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O

explanation
ontology engineering
testing and debugging


Semantic information portals In this paper , we describe the notion of a semantic information portal . This is a community information portal that exploits the semantic web standards to improve structure , extensibility , customization and sustainability . We are in the process of developing a prototype directory of environmental organizations as a demonstration of the approach and outline the design challenges involved and the current status of the work .

O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A query algebra for xml p2p databases This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination , replication constraints , and for capturing the transient nature of data and replicas .

O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O

data description languages
peer data management systems
query algebras


Fine-grained , structured configuration management for web projects Researchers in Web engineering have regularly noted that existing Web application development environments provide little support for managing the evolution of Web applications . Key limitations of Web development environments include line-oriented change models that inadequately represent Web document semantics and in ability to model changes to link structure or the set of objects making up the Webapplication . Developers may find it difficult to grasp how theoverall structure of the Web application has changed over time and may respond by using ad hoc solutions that lead to problems of maintain ability , quality and reliability . Web applications are software artifacts , and as such , can benefit from advanced version control and software configuration management ( SCM ) technologies from software engineering . We have modified an integrated development environment to manage the evolution and maintenance of Web applications . The resulting environment is distinguished by itsfine-grained version control framework , fine-grained Web contentchange management , and product versioning configuration management , in which a Web project can be organized at the logical level and itsstructure and components are versioned in a fine-grained manner aswell . This paper describes the motivation for this environment as well as its user interfaces , features , and implementation .

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


The web around the corner : augmenting the browser with gps As programmable mobile devices ( such as high-end cellular phones and Personal Digital Assistants ) became widely adopted , users ask for Internet access on-the-road . While upcoming technologies like UMTS and Wi-Fi provide broadband wireless communication , Web services and Web browsers do not provide any sort of location-awareness yet . As GPS receivers get cheaper , positioning devices will be embedded into commercial mobile devices . Thus , the position of the user can be used to filter and tailor the information presented to the user as already done for language preferences and user-agent . This paper describes early results of an ongoing project called GPSWeb , which aims to provide GPS support for Web browsers and an application model for Location-Based Services . It introduces the Location-Based Browsing concept that enhances the classic Webuser-Website interaction .

O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O


The role of standards in creating community Participation in the web of communities requires a common language , a common technological structure and development of content that is relevant and captivating . This paper reports on a project that both conserves a rich regional cultural heritage and has structured the content developed during this conservation to be fluidly shared with both the domain and the broader communities . It also examines the varied degrees of acceptance within these communities .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

automatic programming
design tools and techniques
document preparation
dublin core
historic costume collection
language classifications
museums online archive california
network architecture and design
ontology
open archive initiative
semantic web
thesaurus
xml


Type based service composition Service matchmaking and composition has recently drawn increasing attention in the research community . Most existing algorithms construct chains of services based on exact matches of input\/output types . However , this does not work when the available services only cover a part of the range of the input type . We present an algorithm that also allows partial matches and composes them using switches that decide on the required service at runtime based on the actual data type . We report experiments on randomly generated composition problems that show that using partial matches can decrease the failure rate of the integration algorithm using only complete matches by up to 7 times with no increase in the number of directory accesses required . This shows that composition with partial matches is an essential and useful element of web service composition .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O

large scale discovery
runtime non-determinism
type based composition
web services


Regular expressions considered harmful in client-side XSS filters Cross-site scripting flaws have now surpassed buffer overflows as the world 's most common publicly-reported security vulnerability . In recent years , browser vendors and researchers have tried to develop client-side filters to mitigate these attacks . We analyze the best existing filters and find them to be either unacceptably slow or easily circumvented . Worse , some of these filters could introduce vulnerabilities into sites that were previously bug-free . We propose a new filter design that achieves both high performance and high precision by blocking scripts after HTML parsing but before execution . Compared to previous approaches , our approach is faster , protects against more vulnerabilities , and is harder for attackers to abuse . We have contributed an implementation of our filter design to the WebKit open source rendering engine , and the filter is now enabled by default in the Google Chrome browser .

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O B O

cross-site scripting
unauthorized access
web


PageRank as a function of the damping factor PageRank is defined as the stationary state of a Markov chain . The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spreads uniformly part of the rank . The choice of α is eminently empirical , and in most cases the original suggestion α = 0.85 by Brin and Page is still used . Recently , however , the behavior of PageRank with respect to changes in α was discovered to be useful in link-spam detection ( 21 ) . Moreover , an analytical justification of the value chosen for α is still missing . In this paper , we give the first mathematical analysis of PageRank when α changes . In particular , we show that , contrarily to popular belief , for real-world graphs values of α close to 1 do not give a more meaningful ranking . Then , we give closed-form formulae for PageRank derivatives of any order , and an extension of the Power Method that approximates them with convergence O ( tk αt ) for the k-th derivative . Finally , we show a tight connection between iterated computation and analytical behavior by proving that the k-th iteration of the Power Method gives exactly the PageRank value obtained using a Maclaurin polynomial of degree k. The latter result paves the way towards the application of analytical methods to the study of PageRank .

B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O


Milgram-routing in social networks We demonstrate how a recent model of social networks ( `` Affiliation Networks '' , ( 21 ) ) offers powerful cues in local routing within social networks , a theme made famous by sociologist Milgram 's `` six degrees of separation '' experiments . This model posits the existence of an `` interest space '' that underlies a social network ; we prove that in networks produced by this model , not only do short paths exist among all pairs of nodes but natural local routing algorithms can discover them effectively . Specifically , we show that local routing can discover paths of length O ( log2 n ) to targets chosen uniformly at random , and paths of length O ( 1 ) to targets chosen with probability proportional to their degrees . Experiments on the co-authorship graph derived from DBLP data confirm our theoretical results , and shed light into the power of one step of lookahead in routing algorithms for social networks .

O O B I O O O O O O O B I O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O


One document to bind them : combining XML , web services , and the semantic web We present a paradigm for uniting the diverse strands of XML-based Web technologies by allowing them to be incorporated within a single document . This overcomes the distinction between programs and data to make XML truly `` self-describing . '' A proposal for a lightweight yet powerful functional XML vocabulary called `` Semantic fXML '' is detailed , based on the well-understood functional programming paradigm and resembling the embedding of Lisp directly in XML . Infosets are made `` dynamic , '' since documents can now directly embed local processes or Web Services into their Infoset . An optional typing regime for info-sets is provided by Semantic Web ontologies . By regarding Web Services as functions and the Semantic Web as providing types , and tying it all together within a single XML vocabulary , the Web can compute . In this light , the real Web 2.0 can be considered the transformation of the Web from a universal information space to a universal computation space .

O O O O O O O B O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O B I O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

functional programming
semantic web
web services
xml


Design and implementation of contextual information portals This paper presents a system for enabling offline web use to satisfy the information needs of disconnected communities . We describe the design , implementation , evaluation , and pilot deployment of an automated mechanism to construct Contextual Information Portals ( CIPs ) . CIPs are large searchable information repositories of web pages tailored to the information needs of a target population . We combine an efficient classifier with a focused crawler to gather the web pages for the portal for any given topic . Given a set of topics of interest , our system constructs a CIP containing the most relevant pages from the web across these topics . Using several secondary school course syllabi , we demonstrate the effectiveness of our system for constructing CIPs for use as an education resource . We evaluate our system across several metrics : classification accuracy , crawl scalability , crawl accuracy and harvest rate . We describe the utility and usability of our system based on a preliminary deployment study at an after-school program in India , and also outline our ongoing larger-scale pilot deployment at five schools in Kenya .

O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computer uses in education
document classification
focused crawling
hypertext/hypermedia
web portal


Determining user interests about museum collections Currently , there is an increasing effort to provide various personalized services on museum web sites . This paper presents an approach for determining user interests in a museum collection with the help of an interactive dialog . It uses a semantically annotated collection of the Rijksmuseum Amsterdam to elicit specific user 's interests in artists , periods , genres and themes and uses these values to recommend relevant artefacts and related concepts from the museum collection . In the presented prototype , we show how constructing a user profile and applying recommender strategies in this way enable dynamical generation personalized museum tours for different users .

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

knowledge representation formalisms and methods


Relational duality : unsupervised extraction of semantic relations between entities on the web Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction , relation detection , and social network mining . A relation can be expressed extensionally by stating all the instances of that relation or intensionally by defining all the paraphrases of that relation . For example , consider the ACQUISITION relation between two companies . An extensional definition of ACQUISITION contains all pairs of companies in which one company is acquired by another ( e.g. ( YouTube , Google ) or ( Powerset , Microsoft ) ) . On the other hand we can intensionally define ACQUISITION as the relation described by lexical patterns such as X is acquired by Y , or Y purchased X , where X and Y denote two companies . We use this dual representation of semantic relations to propose a novel sequential co-clustering algorithm that can extract numerous relations efficiently from unlabeled data . We provide an efficient heuristic to find the parameters of the proposed coclustering algorithm . Using the clusters produced by the algorithm , we train an L1 regularized logistic regression model to identify the representative patterns that describe the relation expressed by each cluster . We evaluate the proposed method in three different tasks : measuring relational similarity between entity pairs , open information extraction ( Open IE ) , and classifying relations in a social network system . Experiments conducted using a benchmark dataset show that the proposed method improves existing relational similarity measures . Moreover , the proposed method significantly outperforms the current state-of-the-art Open IE systems in terms of both precision and recall . The proposed method correctly classifies 53 relation types in an online social network containing 470 ; 671 nodes and 35 ; 652 ; 475 edges , thereby demonstrating its efficacy in real-world relation detection tasks .

B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

relational duality
relational similarity
web mining


Crawling multiple UDDI business registries As Web services proliferate , size and magnitude of UDDI Business Registries ( UBRs ) are likely to increase . The ability to discover Web services of interest then across multiple UBRs becomes a major challenge specially when using primitive search methods provided by existing UDDI APIs . Clients do not have the time to endlessly search accessible UBRs for finding appropriate services particularly when operating via mobile devices . Finding services of interest should be time effective and highly productive . This paper addresses issues relating to the efficient access and discovery of Web services across multiple UBRs and introduces a novel exploration engine , the Web Service Crawler Engine ( WSCE ) . WSCE is capable of crawling multiple UBRs , and enables for the establishment of a centralized Web services repository that can be used for discovering Web services much more efficiently . The paper presents experimental validation , results , and analysis of the proposed ideas .

O O B O O O B I O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B I O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O


Application specific data replication for edge services The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites . A key challenge in such systems is data replication and consistency so that edge server code can manipulate shared data without incurring the availability and performance penalties that would be incurred by accessing a traditional centralized database . This paper explores using a distributed object architecture to build an edge service system for an e-commerce application , an online bookstore represented by the TPC-W benchmark . We take advantage of application specific semantics to design distributed objects to manage a specific subset of shared information using simple and effective consistency models . Our experimental results show that by slightly relaxing consistency within individual distributed objects , we can build an edge service system that is highly available and efficient . For example , in one experiment we find that our object-based edge server system provides a factor of five improvement in response time over a traditional centralized cluster architecture and a factor of nine improvement over an edge service system that distributes code but retains a centralized database .

O O B I O B I O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

availability
data replication
distributed objects
edge services


Bucefalo : a tool for intelligent search and filtering for web-based personal health records In this poster , a tool named BUCEFALO is presented . This tool is specially designed to improve the information retrieval tasks in web-based Personal Health Records ( PHR ) . This tool implements semantic and multilingual query expansion techniques and information filtering algorithms in order to help users find the most valuable information about a specific clinical case . The filtering model is based on fuzzy prototypes based filtering , data quality measures , user profiles and healthcare ontologies . The first experimental results illustrate the feasibility of this tool .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Topic-sensitive PageRank In the original PageRank algorithm for improving the ranking of search-query results , a single PageRank vector is computed , using the link structure of the Web , to capture the relative `` importance '' of Web pages , independent of any particular search query . To yield more accurate search results , we propose computing a set of PageRank vectors , biased using a set of representative topics , to capture more accurately the notion of importance with respect to a particular topic . By using these ( precomputed ) biased PageRank vectors to generate query-specific importance scores for pages at query time , we show that we can generate more accurate rankings than with a single , generic PageRank vector . For ordinary keyword search queries , we compute the topic-sensitive PageRank scores for pages satisfying the query using the topic of the query keywords . For searches done in context ( e.g. , when the search query is performed by highlighting words in a Web page ) , we compute the topic-sensitive PageRank scores using the topic of the context in which the query appeared .

O B O O O B O O O O O O O O O O O B O O O O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O

personalized search
search in context
web graph


An agent system for ontology sharing on WWW Semantic Web Services ( SWS ) , a new generation WWW technology , will facilitate the automation of Web service tasks , including automated Web service discovery , execution , composition and mediation by using XML based metadata and ontology . There have been several efforts to build knowledge representation languages for Web Services . However , only few attempts have so far been made to develop applications based on SWS . Especially , front-end agent systems for users are one of the urgent research areas . The purpose of this paper is to introduce our new integrated front-end agent system for ontology management and SWS management .

O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O


Network arts : exposing cultural reality In this article , we explore a new role for the computer in art as a reflector of popular culture . Moving away from the static audio-visual installations of other artistic endeavors and from the traditional role of the machine as a computational tool , we fuse art and the Internet to expose cultural connections people draw implicitly but rarely consider directly . We describe several art installations that use the World Wide Web as a reflection of cultural reality to highlight and explore the relations between ideas that compose the fabric of our every day lives .

B I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O

information retrieval
media arts
software agents


Searching with numbers A large fraction of the useful web comprises of specification documents that largely consist of hattribute name , numeric valuei pairs embedded in text . Examples include product information , classified advertisements , resumes , etc. . The approach taken in the past to search these documents by first establishing correspondences between values and their names has achieved limited success because of the difficulty of extracting this information from free text . We propose a new approach that does not require this correspondence to be accurately established . Provided the data has `` low reflectivity '' , we can do effective search even if the values in the data have not been assigned attribute names and the user has omitted attribute names in the query . We give algorithms and indexing structures for implementing the search . We also show how hints ( i. e , imprecise , partial correspondences ) from automatic data extraction techniques can be incorporated into our approach for better accuracy on high reflectivity datasets . Finally , we validate our approach by showing that we get high precision in our answers on real datasets from a variety of domains .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Toward expressive syndication on the web Syndication systems on the Web have attracted vast amounts of attention in recent years . As technologies have emerged and matured , there has been a transition to more expressive syndication approaches ; that is , subscribers and publishers are provided with more expressive means of describing their interests and published content , enabling more accurate information filtering . In this paper , we formalize a syndication architecture that utilizes expressive Web ontologies and logic-based reasoning for selective content dissemination . This provides finer grained control for filtering and automated reasoning for discovering implicit subscription matches , both of which are not achievable in less expressive approaches . We then address one of the main limitations with such a syndication approach , namely matching newly published information with subscription requests in an efficient and practical manner . To this end , we investigate continuous query answering for a large subset of the Web Ontology Language ( OWL ) ; specifically , we formally define continuous queries for OWL knowledge bases and present a novel algorithm for continuous query answering in a large subset of this language . Lastly , an evaluation of the query approach is shown , demonstrating its effectiveness for syndication purposes .

O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O B O O


Two birds with one stone : a graph-based framework for disambiguating and tagging people names in web search The ever growing volume of Web data makes it increasingly challenging to accurately find relevant information about a specific person on the Web . To address the challenge caused by name ambiguity in Web people search , this paper explores a novel graph-based framework to both disambiguate and tag people entities in Web search results . Experimental results demonstrate the effectiveness of the proposed framework in tag discovery and name disambiguation .

O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O


On incremental maintenance of 2-hop labeling of graphs Recent interests on XML , Semantic Web , and Web ontology , among other topics , have sparked a renewed interest on graph-structured databases . A fundamental query on graphs is the reachability test of nodes . Recently , 2-hop labeling has been proposed to index large collections of XML and\/or graphs for efficient reachability tests . However , there has been few work on updates of 2-hop labeling . This is compounded by the fact that Web data changes over time . In response to these , this paper studies the incremental maintenance of 2-hop labeling . We identify the main reason for the inefficiency of updates of existing 2-hop labels . We propose two updatable 2-hop labelings , hybrids of 2-hop labeling , and their incremental maintenance algorithms . The proposed 2-hop labeling is derived from graph connectivities , as opposed to set cover which is used by all previous work . Our experimental evaluation illustrates the space efficiency and update performance of various kinds of 2-hop labeling . The main conclusion is that there is a natural way to spare some index size for update performance in 2-hop labeling .

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

incremental maintenance
reachability test


A more precise model for web retrieval Most research works on web retrieval latency are object-level based , which we think is insufficient and sometimes inaccurate . In this paper , we propose a fine grained operation-level Web Retrieval Dependency Model ( WRDM ) to provide more precise capture of web retrieval process . Our model reveals some new factors in web retrieval which can not be seen at object level but are very important to studies in the web retrieval area .

O O O B O B I O O O O B I B O O O O O O O O O O O O O O O O O O O O O O O B I B B O O O O O O O O O B I O O O B O O O O O B I O O O O O O O O O O O O O O O O B I O O


Affinity rank : a new scheme for efficient web search Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents . In this paper , we propose two new metrics to evaluate the performance of information retrieval : diversity , which measures the topic coverage of a group of documents , and information richness , which measures the amount of information contained in a document . Then we present a novel ranking scheme , Affinity Rank , which utilizes these two metrics to improve search results . We demonstrate how Affinity Rank works by a toy data set , and verify our method by experiments on real-world data sets .

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O

affinity rank
diversity
information richness


Statistical models of music-listening sessions in social media User experience in social media involves rich interactions with the media content and other participants in the community . In order to support such communities , it is important to understand the factors that drive the users ' engagement . In this paper we show how to define statistical models of different complexity to describe patterns of song listening in an online music community . First , we adapt the LDA model to capture music taste from listening activities across users and identify both the groups of songs associated with the specific taste and the groups of listeners who share the same taste . Second , we define a graphical model that takes into account listening sessions and captures the listening moods of users in the community . Our session model leads to groups of songs and groups of listeners with similar behavior across listening sessions and enables faster inference when compared to the LDA model . Our experiments with the data from an online media site demonstrate that the session model is better in terms of the perplexity compared to two other models : the LDA-based taste model that does not incorporate cross-session information and a baseline model that does not use latent groupings of songs .

O O O O B O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B B O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O

collaborative filtering
database applications
graphical models
mood
recommendations


Distributed community crawling The massive distribution of the crawling task can lead to inefficient exploration of the same portion of the Web . We propose a technique to guide crawlers exploration based on the notion of Web communities . Thest ability properties of the method can be used as an implicit coordination mechanism to increase the efficiency of the crawling task .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O


Lock-free consistency control for web 2.0 applications Online collaboration and sharing is the central theme of many web-based services that create the so-called Web 2.0 phenomena . Using the Internet as a computing platform , many Web 2.0 applications set up mirror sites to provide large-scale availability and to achieve load balance . However , in the age of Web 2.0 , where every user is also a writer and publisher , the deployment of mirror sites makes consistency maintenance a Web scale problem . Traditional concurrency control methods ( e.g. two phase lock , serialization , etc. ) are not up to the task for several reasons . First , large network latency between mirror sites will make two phase locking a throughput bottleneck . Second , locking will block a large portion of concurrent operations , which makes it impossible to provide large-scale availability . On the other hand , most Web 2.0 operations do not need strict serializability - it is not the intention of a user who is correcting a typo in a shared document to block another who is adding a comment , as long as consistency can still be achieved . Thus , in order to enable maximal online collaboration and sharing , we need a lock-free mechanism that can maintain consistency among mirror sites on the Web . In this paper , we propose a flexible and efficient method to achieve consistency maintenance in the Web 2.0 world . Our experiments show its good performance improvement compared with existing methods based on distributed lock .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

concurrency control
consistency maintenance


Information spreading in context Information spreading processes are central to human interactions . Despite recent studies in online domains , little is known about factors that could affect the dissemination of a single piece of information . In this paper , we address this challenge by combining two related but distinct datasets , collected from a large scale privacy-preserving distributed social sensor system . We find that the social and organizational context significantly impacts to whom and how fast people forward information . Yet the structures within spreading processes can be well captured by a simple stochastic branching model , indicating surprising independence of context . Our results build the foundation of future predictive models of information flow and provide significant insights towards design of communication platforms .

O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O

information spread
network science
social networks
structure


Social recommender systems The goal of this tutorial is to expose participants to the current research on social recommender systems ( i.e. , recommender systems for the social web ) . Participants will become familiar with state-of-the-art recommendation methods , their classifications according to various criteria , common evaluation methodologies , and potential applications that can utilize social recommender systems . Additionally , open issues and challenges in the field will be discussed .

O B I O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O


Scaling link-based similarity search To exploit the similarity information hidden in the hyperlink structure of the web , this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture . The similarity of multi-step neighborhoods of vertices are numerically evaluated by similarity functions including SimRank ( 20 ) , a recursive refinement of cocitation ; PSimRank , a novel variant with better theoretical characteristics ; and the Jaccard coefficient , extended to multi-step neighborhoods . Our methods are presented in a general framework of Monte Carlo similarity search algorithms that precompute an index database of random fingerprints , and at query time , similarities are estimated from the fingerprints . The performance and quality of the methods were tested on the Stanford Webbase ( 19 ) graph of 80M pages by comparing our scores to similarities extracted from the ODP directory ( 26 ) . Our experimental results suggest that the hyperlink structure of vertices within four to five steps provide more adequate information for similarity search than single-step neighborhoods .

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

fingerprint
information search and retrieval
link-analysis
probabilistic algorithms
scalability


Parallel crawling for online social networks Given a huge online social network , how do we retrieve information from it through crawling ? Even better , how do we improve the crawling performance by using parallel crawlers that work independently ? In this paper , we present the framework of parallel crawlers for online social networks , utilizing a centralized queue . To show how this works in practice , we describe our implementation of the crawlers for an online auction website . The crawlers work independently , therefore the failing of one crawler does not affect the others at all . The framework ensures that no redundant crawling would occur . Using the crawlers that we built , we visited a total of approximately 11 million auction users , about 66,000 of which were completely crawled .

O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallelization
software architectures
web crawler
web spider


QUBE : a quick algorithm for updating betweenness centrality The betweenness centrality of a vertex in a graph is a measure for the participation of the vertex in the shortest paths in the graph . The Betweenness centrality is widely used in network analyses . Especially in a social network , the recursive computation of the betweenness centralities of vertices is performed for the community detection and finding the influential user in the network . Since a social network graph is frequently updated , it is necessary to update the betweenness centrality efficiently . When a graph is changed , the betweenness centralities of all the vertices should be recomputed from scratch using all the vertices in the graph . To the best of our knowledge , this is the first work that proposes an efficient algorithm which handles the update of the betweenness centralities of vertices in a graph . In this paper , we propose a method that efficiently reduces the search space by finding a candidate set of vertices whose betweenness centralities can be updated and computes their betweenness centeralities using candidate vertices only . As the cost of calculating the betweenness centrality mainly depends on the number of vertices to be considered , the proposed algorithm significantly reduces the cost of calculation . The proposed algorithm allows the transformation of an existing algorithm which does not consider the graph update . Experimental results on large real datasets show that the proposed algorithm speeds up the existing algorithm 2 to 2418 times depending on the dataset .

O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Efficient Web form entry on PDAs

forms
html
mobile computing
pda
portable devices
wap
wireless access


Bootstrapping semantics on the web : meaning elicitation from schemas In most web sites , web-based applications ( such as web portals , e-marketplaces , search engines ) , and in the file systems of personal computers , a wide variety of schemas ( such as taxonomies , directory trees , thesauri , Entity-Relationship schemas , RDF Schemas ) are published which ( i ) convey a clear meaning to humans ( e.g. help in the navigation of large collections of documents ) , but ( ii ) convey only a small fraction ( if any ) of their meaning to machines , as their intended meaning is not formally\/explicitly represented . In this paper we present a general methodology for automatically eliciting and representing the intended meaning of these structures , and for making this meaning available in domains like information integration and interoperability , web service discovery and composition , peer-to-peer knowledge management , and semantic browsers . We also present an implementation ( called CtxMatch2 ) of how such a method can be used for semantic interoperability .

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Metadata co-development : a process resulting in metadata about technical assistance to educators Metadata development can be challenging because the vocabulary should be flexible and extensible , widely applicable , interoperable , and both machine and human readable . We describe how we engaged members of organizations in the field of technical assistance to educators in a process of metadata development , and the challenges we faced . The result was a an ontology for the communities of practice that is interoperable and can evolve it was then used to catalogue resources for dissemination via the Semantic Web .

B O O O O O O B O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

metadata
semantic web
technical assistance

computer uses in education
education
rdf
resource cataloging


The design and implementation of the redland RDF application framework


What is disputed on the web ? We present a method for automatically acquiring of a corpus of disputed claims from the web . We consider a factual claim to be disputed if a page on the web suggests both that the claim is false and also that other people say it is true . Our tool extracts disputed claims by searching the web for patterns such as `` falsely claimed that X '' and then using a statistical classifier to select text that appears to be making a disputed claim . We argue that such a corpus of disputed claims is useful for a wide range of applications related to information credibility on the web , and we report what our current corpus reveals about what is being disputed on the web .

O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O B O


Semantic analytics on social networks : experiences in addressing the problem of conflict of interest detection In this paper , we describe a Semantic Web application that detects Conflict of Interest ( COI ) relationships among potential reviewers and authors of scientific papers . This application discovers various ` semantic associations ' between the reviewers and authors in a populated ontology to determine a degree of Conflict of Interest . This ontology was created by integrating entities and relationships from two social networks , namely `` knows , '' from a FOAF ( Friend-of-a-Friend ) social network and `` co-author , '' from the underlying co-authorship network of the DBLP bibliography . We describe our experiences developing this application in the context of a class of Semantic Web applications , which have important research and engineering challenges in common . In addition , we present an evaluation of our approach for real-life COI detection .

B I O B I O O O O O O O B I I O O O O O O O O B I O O O B I I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O

conflict of interest
semantic analytics
semantic associations
semantic web
social networks

data fusion
entity disambiguation
miscellaneous
ontologies
peer review process
rdf


Extrapolation methods for accelerating PageRank computations We present a novel algorithm for the fast computation of PageRank , a hyperlink-based estimate of the '' importance '' of Web pages . The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph . The algorithm presented here , called Quadratic Extrapolation , accelerates the convergence of the Power Method by periodically subtracting off estimates of the nonprincipal eigenvectors from the current iterate of the Power Method . In Quadratic Extrapolation , we take advantage of the fact that the first eigenvalue of a Markov matrix is known to be 1 to compute the nonprincipal eigenvectors using successive iterates of the Power Method . Empirically , we show that using Quadratic Extrapolation speeds up PageRank computation by 25-300 % on a Web graph of 80 million nodes , with minimal overhead . Our contribution is useful to the PageRank community and the numerical linear algebra community in general , as it is a fast method for determining the dominant eigenvector of a matrix that is too large for standard fast methods to be practical .

O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

eigenvalues and eigenvectors
eigenvector computation
link analysis


Exploiting the deep web with DynaBot : matching , probing , and ranking We present the design of Dynabot , a guided Deep Web discovery system . Dynabot 's modular architecture supports focused crawling of the Deep Web with an emphasis on matching , probing , and ranking discovered sources using two key components : service class descriptions and source-biased analysis . We describe the overall architecture of Dynabot and discuss how these components support effective exploitation of the massive Deep Web data available .

O O B I O O O O O B O O O O O O O O O O O O B I O O O O O O O O O B O O B I O O O O O O B O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O


Is question answering an acquired skill ? We present a question answering ( QA ) system which learns how to detect and rank answer passages by analyzing questions and their answers ( QA pairs ) provided as training data . We built our system in only a few person-months using off-the-shelf components : a part-of-speech tagger , a shallow parser , a lexical network , and a few well-known supervised learning algorithms . In contrast , many of the top TREC QA systems are large group efforts , using customized ontologies , question classifiers , and highly tuned ranking functions . Our ease of deployment arises from using generic , trainable algorithms that exploit simple feature extractors on QA pairs . With TREC QA data , our system achieves mean reciprocal rank ( MRR ) that compares favorably with the best scores in recent years , and generalizes from one corpus to another . Our key technique is to recover , from the question , fragments of what might have been posed as a structured query , had a suitable schema been available . comprises selectors : tokens that are likely to appear ( almost ) unchanged in an answer passage . The other fragment contains question tokens which give clues about the answer type , and are expected to be replaced in the answer passage by tokens which specialize or instantiate the desired answer type . Selectors are like constants in where-clauses in relational queries , and answer types are like column names . We present new algorithms for locating selectors and answer type clues and using them in scoring passages with respect to a question .

O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Predicting click through rate for job listings Click Through Rate ( CTR ) is an important metric for ad systems , job portals , recommendation systems . CTR impacts publisher 's revenue , advertiser 's bid amounts in `` pay for performance '' business models . We learn regression models using features of the job , optional click history of job , features of `` related '' jobs . We show that our models predict CTR much better than predicting avg . CTR for all job listings , even in absence of the click history for the job listing .

O B I I O O O B I I O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O

cpc
gbdt
gradient boosted decision trees
information search and retrieval
learning
linear regression
prediction
treenet


Preferential walk : towards efficient and scalable search in unstructured peer-to-peer networks To improve search efficiency and reduce unnecessary traffic in Peer-to-Peer ( P2P ) networks , this paper proposes a trust-based probabilistic search algorithm , called preferential walk ( P-Walk ) . Every peer ranks its neighbors according to searching experience . The highly ranked neighbors have higher probabilities to be queried . Simulation results show that P-Walk is not only efficient , but also robust against malicious behaviors . Furthermore , we measure peers ' rank distribution and draw implications .

O O O O O O O B O O O O O O B O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

power-law
probabilistic algorithms
probability
trust


Network-aware forward caching This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network . A key advantage of this approach is that we can reduce the network costs associated with forward caching to maximize the benefit obtained from their deployment . We show in our simulation that a 37 % increase to net benefits could be achieved over the standard method of full cache deployment to cache all POPs traffic . In addition , we show that this maximal point occurs when only 68 % of the total traffic is cached . Another contribution of this paper is the analysis we use to motivate and evaluate this problem . We characterize the Internet traffic of 100K subscribers of a US residential broadband provider . We use both layer 4 and layer 7 analysis to investigate the traffic volumes of the flows as well as study the general characteristics of the applications used . We show that HTTP is a dominant protocol and account for 68 % of the total downstream traffic and that 34 % of that traffic is multimedia . In addition , we show that multimedia content using HTTP exhibits a 83 % annualized growth rate and other HTTP traffic has a 53 % growth rate versus the 26 % over all annual growth rate of broadband traffic . This shows that HTTP traffic will become ever more dominent and increase the potential caching opportunities . Furthermore , we characterize the core backbone traffic of this broadband provider to measure the distance traveled by content and traffic . We find that CDN traffic is much more efficient than P2P content and that there is large skew in the Air Miles between POP in a typical network . Our findings show that there are many opportunties in broadband provider networks to optimize how traffic is delivered and cached .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Building an open source meta-search engine In this short paper we introduce Helios , a flexible and efficient open source meta-search engine . Helios currently runs on the top of 18 search engines ( in Web , Books , News , and Academic publication domains ) , but additional search engines can be easily plugged in . We also report some performance mesured during its development .

O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information search and retrieval
meta search engines


Implementing physical hyperlinks using ubiquitous identifier resolution Identifier resolution is presented as a way to link the physical world with virtual Web resources . In this paradigm , designed to support nomadic users , the user employs a handheld , wirelessly connected , sensor-equipped device to read identifiers associated with physical entities . The identifiers are resolved into virtual resources or actions related to the physical entities - as though the user ` clicked on a physical hyperlink ' . We have integrated identifier resolution with the Web so that it can be deployed as ubiquitously as the Web , in the infrastructure and on wirelessly connected handheld devices . We enable users to capture resolution services and applications as Web resources in their local context . We use the Web to invoke resolution services , with a model of ` physical ' Web form-filling . We propose a scheme for binding identifiers to resources , to promote services and applications linking the physical and virtual worlds .

O B I O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

identifier resolution
physical hyperlinks

mobile computing
nomadic computing
ubiquitous computing


Behavioral classification on the click graph A bipartite query-URL graph , where an edge indicates that a document was clicked for a query , is a useful construct for finding groups of related queries and URLs . Here we use this behavior graph for classification . We choose a click graph sampled from two weeks of image search activity , and the task of `` adult '' filtering : identifying content in the graph that is inappropriate for minors . We show how to perform classification using random walks on this graph , and two methods for estimating classifier parameters .

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O

click data
content analysis and indexing
learning


Pagerank for product image search In this paper , we cast the image-ranking problem into the task of identifying `` authority '' nodes on an inferred visual similarity graph and propose an algorithm to analyze the visual link structure that can be created among a group of images . Through an iterative procedure based on the PageRank computation , a numerical weight is assigned to each image ; this measures its relative importance to the other images being considered . The incorporation of visual signals in this process differs from the majority of large-scale commercial-search engines in use today . Commercial search-engines often solely rely on the text clues of the pages in which images are embedded to rank images , and often entirely ignore the content of the images themselves as a ranking signal . To quantify the performance of our approach in a real-world system , we conducted a series of experiments based on the task of retrieving images for 2000 of the most popular products queries . Our experimental results show significant improvement , in terms of user satisfaction and relevancy , in comparison to the most recent Google Image Search results .

B O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

graph theory
information search and retrieval


Conversation specification : a new approach to design and analysis of e-service composition This paper introduces a framework for modeling and specifying the global behavior of e-service compositions . Under this framework , peers ( individual e-services ) communicate through asynchronous messages and each peer maintains a queue for incoming messages . A global `` watcher '' keeps track of messages as they occur . We propose and study a central notion of a `` conversation '' , which is a sequence of ( classes of ) messages observed by the watcher . We consider the case where the peers are represented by Mealy machines ( finite state machines with input and output ) . The sets of conversations exhibit unexpected behaviors . For example , there exists a composite e-service based on Mealy peers whose set of conversations is not context free ( and not regular ) . ( The set of conversations is always context sensitive . ) One cause for this is the queuing of messages ; we introduce an operator `` prepone '' that simulates queue delays from a global perspective and show that the set of conversations of each Mealy e-service is closed under prepone . We illustrate that the global prepone fails to completely capture the queue delay effects and refine prepone to a `` local '' version on conversations seen by individual peers . On the other hand , Mealy implementations of a composite e-service will always generate conversations whose `` projections '' are consistent with individual e-services . We use projection-join to reflect such situations . However , there are still Mealy peers whose set of conversations is not the local prepone and projection-join closure of any regular language . Therefore , we propose conversation specifications as a formalism to define the conversations allowed by an e-service composition . We give two technical results concerning the interplay between the local behaviors of Mealy peers and the global behaviors of their compositions . One result shows that for each regular language , its local prepone and projection-join closure corresponds to the set of conversations by some Mealy peers effectively constructed from . The second result gives a condition on the shape of a composition which guarantees that the set of conversations that can be realized is the local prepone and projection-join closure of a regular language .

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

communicating finite sate automata
e-service composition


Detecting near-duplicates for web crawling Near-duplicate web documents are abundant . Two such documents differ from each other in a very small portion that displays advertisements , for example . Such differences are irrelevant for web search . So the quality of a web crawler increases if it can assess whether a newly crawled web page is a near-duplicate of a previously crawled web page or not . In the course of developing a near-duplicate detection system for a multi-billion page repository , we make two research contributions . First , we demonstrate that Charikar 's fingerprinting technique is appropriate for this goal . Second , we present an algorithmic technique for identifying existing f-bit fingerprints that differ from a given fingerprint in at most k bit-positions , for small k. Our technique is useful for both online queries ( single fingerprints ) and all batch queries ( multiple fingerprints ) . Experimental evaluation over real data confirms the practicality of our design .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hamming distance
near-duplicate
similarity
sketch
web crawl
web document


Automatic identification of user interest for personalized search One hundred users , one hundred needs . As more and more topics are being discussed on the web and our vocabulary remains relatively stable , it is increasingly difficult to let the search engine know what we want . Coping with ambiguous queries has long been an important part of the research on Information Retrieval , but still remains a challenging task . Personalized search has recently got significant attention in addressing this challenge in the web search community , based on the premise that a user 's general preference may help the search engine disambiguate the true intention of a query . However , studies have shown that users are reluctant to provide any explicit input on their personal preference . In this paper , we study how a search engine can learn a user 's preference automatically based on her past click history and how it can use the user preference to personalize search results . Our experiments show that users ' preferences can be learned accurately even from little click-history data and personalized search based on user preference yields significant improvements over the best existing ranking mechanism in the literature .

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O


QoS computation and policing in dynamic web service selection The emerging Service-Oriented Computing ( SOC ) paradigm promises to enable businesses and organizations to collaborate in an unprecedented way by means of standard web services . To support rapid and dynamic composition of services in this paradigm , web services that meet requesters ' functional requirements must be able to be located and bounded dynamically from a large and constantly changing number of service providers based on their Quality of Service ( QoS ) . In order to enable quality-driven web service selection , we need an open , fair , dynamic and secure framework to evaluate the QoS of a vast number of web services . The fair computation and enforcing of QoS of web services should have minimal overhead but yet able to achieve sufficient trust by both service requesters and providers . In this paper , we presented our open , fair and dynamic QoS computation model for web services selection through implementation of and experimentation with a QoS registry in a hypothetical phone service provisioning market place application .

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B I O O O O O O O O B O O O O O O O O O O O


Robust methodologies for modeling web click distributions Metrics such as click counts are vital to online businesses but their measurement has been problematic due to inclusion of high variance robot traffic . We posit that by applying statistical methods more rigorous than have been employed to date that we can build a robust model of thedistribution of clicks following which we can set probabilistically sound thresholds to address outliers and robots . Prior research in this domain has used inappropriate statistical methodology to model distributions and current industrial practice eschews this research for conservative ad-hoc click-level thresholds . Prevailing belief is that such distributions are scale-free power law distributions but using more rigorous statistical methods we find the best description of the data is instead provided by a scale-sensitive Zipf-Mandelbrot mixture distribution . Our results are based on ten data sets from various verticals in the Yahoo domain . Since mixture models can overfit the data we take care to use the BIC log-likelihood method which penalizes overly complex models . Using a mixture model in the web activity domain makes sense because there are likely multiple classes of users . In particular , we have noticed that there is a significantly large set of `` users '' that visit the Yahoo portal exactly once a day . We surmise these may be robots testing internet connectivity by pinging the Yahoo main website . Backing up our quantitative analysis is graphical analysis in which empirical distributions are plotted against heoretical distributions in log-log space using robust cumulative distribution plots . This methodology has two advantages : plotting in log-log space allows one to visually differentiate the various exponential distributions and secondly , cumulative plots are much more robust to outliers . We plan to use the results of this work for applications for robot removal from web metrics business intelligence systems .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


pTHINC : a thin-client architecture for mobile wireless web Although web applications are gaining popularity on mobile wireless PDAs , web browsers on these systems can be quite slow and often lack adequate functionality to access many web sites . We have developed pTHINC , a PDA thin-client solution that leverages more powerful servers to run full-function web browsers and other application logic , then sends simple screen updates to the PDA for display . pTHINC uses server-side screen scaling to provide high-fidelity display and seamless mobility across a broad range of different clients and screen sizes , including both portrait and landscape viewing modes . pTHINC also leverages existing PDA control buttons to improve system usability and maximize available screen resolution for application display . We have implemented pTHINC on Windows Mobile and evaluated its performance on mobile wireless devices . Our results compared to local PDA web browsers and other thin-client approaches demonstrate that pTHINC provides superior web browsing performance and is the only PDA thin client that effectively supports crucial browser helper applications such as video playback .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

pervasive web
remote display
thin-client computing


GalaTex : a conformant implementation of the XQuery full-text language We describe GalaTex , the first complete implementation of XQuery Full-Text , a W3C specification that extends XPath 2.0 and XQuery 1.0 with full-text search . XQuery Full-Text provides composable full-text search primitives such as keyword search , Boolean queries , and keyword-distance predicates . GalaTex is intended to serve as a reference implementation for XQuery Full-Text and as a platform for addressing new research problems such as scoring full-text query results , optimizing XML queries over both structure and text , and evaluating top-k queries on scored results . GalaTex is an all-XQuery implementation initially focused on completeness and conformance rather than on efficiency . We describe its implementation on top of Galax , a complete XQuery implementation .

O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O

conformant prototype
full-text
information search and retrieval


A comparison of case-based reasoning approaches Over the years software engineering researchers have suggested numerous techniques for estimating development effort . These techniques have been classified mainly as algorithmic , machine learning and expert judgement . Several studies have compared the prediction accuracy of those techniques , with emphasis placed on linear regression , stepwise regression , and Case-based Reasoning ( CBR ) . To date no converging results have been obtained and we believe they may be influenced by the use of the same CBR configuration . The objective of this paper is twofold . First , to describe the application of case-based reasoning for estimating the effort for developing Web hypermedia applications . Second , comparing the prediction accuracy of different CBR configurations , using two Web hypermedia datasets . Results show that for both datasets the best estimations were obtained with weighted Euclidean distance , using either one analogy ( dataset 1 ) or 3 analogies ( dataset 2 ) . We suggest therefore that case-based reasoning is a candidate technique for effort estimation and , with the aid of an automated environment , can be applied to Web hypermedia development effort prediction .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

case-based reasoning
general
metrics
prediction models
web effort prediction
web hypermedia metrics


A quality framework for web site quality : user satisfaction and quality assurance Web site developers need to use of standards and best practices to ensure that Web sites are functional , accessible and interoperable . However many Web sites fail to achieve such goals . This short paper describes how a Web site quality assessment method ( E-Qual ) might be used in conjunction with a quality assurance framework ( QA Focus ) to provide a rounded view of Web site quality that takes account of end user and developer perspectives .

O O O O B I I O O O O B I O O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O O O O B I I O O O O O O O O O O

best practices
quality assurance
standards
web site quality


REST-based management of loosely coupled services Applications increasingly make use of the distributed platform that the World Wide Web provides - be it as a Software-as-a-Service such as salesforce.com , an application infrastructure such as facebook.com , or a computing infrastructure such as a `` cloud '' . A common characteristic of applications of this kind is that they are deployed on infrastructure or make use of components that reside in different management domains . Current service management approaches and systems , however , often rely on a centrally managed configuration management database ( CMDB ) , which is the basis for centrally orchestrated service management processes , in particular change management and incident management . The distribution of management responsibility of WWW based applications requires a decentralized approach to service management . This paper proposes an approach of decentralized service management based on distributed configuration management and service process co-ordination , making use RESTful access to configuration information and ATOM-based distribution of updates as a novel foundation for service management processes .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O

discovery
general
loosely coupled systems
rest


Mining the search trails of surfing crowds : identifying relevant websites from user activity The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users . While it has been previously shown that user interactions with search engines can be employed to improve document ranking , browsing behavior that occurs beyond search result pages has been largely overlooked in prior work . The paper demonstrates that users ' post-search browsing activity strongly reflects implicit endorsement of visited pages , which allows estimating topical relevance of Web resources by mining large-scale datasets of search trails . We present heuristic and probabilistic algorithms that rely on such datasets for suggesting authoritative websites for search queries . Experimental evaluation shows that exploiting complete post-search browsing trails outperforms alternatives in isolation ( e.g. , clickthrough logs ) , and yields accuracy improvements when employed as a feature in learning to rank for Web search .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

implicit feedback
learning from user behavior
mining search and browsing logs


LINKREC : a unified framework for link recommendation with user attributes and graph structure With the phenomenal success of networking sites ( e.g. , Facebook , Twitter and LinkedIn ) , social networks have drawn substantial attention . On online social networking sites , link recommendation is a critical task that not only helps improve user experience but also plays an essential role in network growth . In this paper we propose several link recommendation criteria , based on both user attributes and graph structure . To discover the candidates that satisfy these criteria , link relevance is estimated using a random walk algorithm on an augmented social graph with both attribute and structure information . The global and local influence of the attributes is leveraged in the framework as well . Besides link recommendation , our framework can also rank attributes in a social network . Experiments on DBLP and IMDB data sets demonstrate that our method outperforms state-of-the-art methods based on network structure and node attribute information for link recommendation .

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O


Large scale multi-label classification via metalabeler The explosion of online content has made the management of such content non-trivial . Web-related tasks such as web page categorization , news filtering , query categorization , tag recommendation , etc. often involve the construction of multi-label categorization systems on a large scale . Existing multi-label classification methods either do not scale or have unsatisfactory performance . In this work , we propose MetaLabeler to automatically determine the relevant set of labels for each instance without intensive human involvement or expensive cross-validation . Extensive experiments conducted on benchmark data show that the MetaLabeler tends to outperform existing methods . Moreover , MetaLabeler scales to millions of multi-labeled instances and can be deployed easily . This enables us to apply the MetaLabeler to a large scale query categorization problem in Yahoo ! , yielding a significant improvement in performance .

B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O B I B I O O O O O O O O O O O O

large scale
metalabeler
query categorization

hierarchical classification
meta model
multi-label classification


Named graphs , provenance and trust The Semantic Web consists of many RDF graphs nameable by URIs . This paper extends the syntax and semantics of RDF to cover such Named Graphs . This enables RDF statements that describe graphs , which is beneficial in many Semantic Web application areas . As a case study , we explore the application area of Semantic Web publishing : Named Graphs allow publishers to communicate assertional intent , and to sign their graphs ; information consumers can evaluate specific graphs using task-specific trust policies , and act on information from those Named Graphs that they accept . Graphs are trusted depending on : their content ; information about the graph ; and the task the user is performing . The extension of RDF to Named Graphs provides a formally defined framework to be a foundation for the Semantic Web trust layer .

O O O B O B O B I O O O B O O O O O O O O O O O O O B O O O O O O O O B O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B I B O O

knowledge representation formalisms and methods


News article extraction with template-independent wrapper We consider the problem of template-independent news extraction . The state-of-the-art news extraction method is based on template-level wrapper induction , which has two serious limitations . 1 ) It can not correctly extract pages belonging to an unseen template until the wrapper for that template has been generated . 2 ) It is costly to maintain up-to-date wrappers for hundreds of websites , because any change of a template may lead to the invalidation of the corresponding wrapper . In this paper we formalize news extraction as a machine learning problem and learn a template-independent wrapper using a very small number of labeled news pages from a single site . Novel features dedicated to news titles and bodies are developed respectively . Correlations between the news title and the news body are exploited . Our template-independent wrapper can extract news pages from different sites regardless of templates . In experiments , a wrapper is learned from 40 pages from a single news site . It achieved 98.1 % accuracy over 3,973 news pages from 12 news sites .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O