Improving Web search efficiency via a locality based static pruning method The unarguably fast , and continuous , growth of the volume of indexed ( and indexable ) documents on the Web poses a great challenge for search engines . This is true regarding not only search effectiveness but also time and space efficiency . In this paper we present an index pruning technique targeted for search engines that addresses the latter issue without disconsidering the former . To this effect , we adopt a new pruning strategy capable of greatly reducing the size of search engine indices . Experiments using a real search engine show that our technique can reduce the indices ' storage costs by up to 60 % over traditional lossless compression methods , while keeping the loss in retrieval precision to a minimum . When compared to the indices size with no compression at all , the compression rate is higher than 88 % , i.e. , less than one eighth of the original size . More importantly , our results indicate that , due to the reduction in storage overhead , query processing time can be reduced to nearly 65 % of the original time , with no loss in average precision . The new method yields significative improvements when compared against the best known static pruning method for search engine indices . In addition , since our technique is orthogonal to the underlying search algorithms , it can be adopted by virtually any search engine .

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 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 B I 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 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


Evaluating similarity measures for emergent semantics of social tagging Social bookmarking systems are becoming increasingly important data sources for bootstrapping and maintaining Semantic Web applications . Their emergent information structures have become known as folksonomies . A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies , and which measures are best suited for applications such as community detection , navigation support , semantic search , user profiling and ontology learning . Here we build an evaluation framework to compare various general folksonomy-based similarity measures , which are derived from several established information-theoretic , statistical , and practical measures . Our framework deals generally and symmetrically with users , tags , and resources . For evaluation purposes we focus on similarity between tags and between resources and consider different methods to aggregate annotations across users . After comparing the ability of several tag similarity measures to predict user-created tag relations , we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory Project . We also investigate the issue of scalability . We find that mutual information with distributional micro-aggregation across users yields the highest accuracy , but is not scalable ; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations . The results are consistent across resource and tag similarity .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

information search and retrieval
semantic grounding
social similarity
web 2.0


Externalities in online advertising Most models for online advertising assume that an advertiser 's value from winning an ad auction , which depends on the clickthrough rate or conversion rate of the advertisement , is independent of other advertisements served alongside it in the same session . This ignores an important ` externality effect ' : as the advertising audience has a limited attention span , a high-quality ad on a page can detract attention from other ads on the same page . That is , the utility to a winner in such an auction also depends on the set of other winners . In this paper , we introduce the problem of modeling externalities in online advertising , and study the winner determination problem in these models . Our models are based on choice models on the audience side . We show that in the most general case , the winner determination problem is hard even to approximate . However , we give an approximation algorithm for this problem with an approximation factor that is logarithmic in the ratio of the maximum to the minimum bid . Furthermore , we show that there are some interesting special cases , such as the case where the audience preferences are single peaked , where the problem can be solved exactly in polynomial time . For all these algorithms , we prove that the winner determination algorithm can be combined with VCG-style payments to yield truthful mechanisms .

B O O B 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 O O O O O O O O O O O O O O O O O O O O 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 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


A foundation for tool based mobility support for visually impaired web users Users make journeys through the Web . Web travel encompasses the tasks of orientation and navigation , the environment and the purpose of the journey . The ease of travel , its mobility , varies from page to page and site to site . For visually impaired users , in particular , mobility is reduced ; the objects that support travel are inaccessible or missing altogether . Web development tools need to include support to increase mobility . We present a framework for finding and classifying travel objects within Web pages . The evaluation carried out has shown that this framework supports a systematic and consistent method for assessing travel upon the Web . We propose that such a framework can provide the foundation for a semi-automated tool for the support of travel upon the Web .

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 B O O B 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 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 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 B O O O O

mobility support tool
travel objects
visual impairment


Extensible schema documentation with XSLT 2.0 XML Schema documents are defined using an XML syntax , which means that the idea of generating schema documentation through standard XML technologies is intriguing . We present X2Doc , a framework for generating schema-documentation solely through XSLT . The framework uses SCX , an XML syntax for XML Schema components , as intermediate format and produces XML-based output formats . Using a modular set of XSLT stylesheets , X2Doc is highly configurable and carefully crafted towards extensibility . This proves especially useful for composite schemas , where additional schema information like Schematron rules are embedded into XML Schemas .

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 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 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


Towards efficient dominant relationship exploration of the product items on the web In recent years , there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which define a natural graph structure that yields a good ranking . Unfortunately , current search engines can not effectively rank those relational data , which exists on dynamic websites supported by online databases . In this study , to rank such structured data ( i.e. , find the `` best '' items ) , we propose an integrated online system consisting of compressed data structure to encode the dominant relationship of the relational data . Efficient querying strategies and updating scheme are devised to facilitate the ranking process . Extensive experiments illustrate the effectiveness and efficiency of our methods . As such , we believe the work in this poster can be complementary to traditional search engines .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 extraction
information search and retrieval
search process


CONQUER : a system for efficient context-aware query suggestions Many of today 's search engines provide autocompletion while the user is typing a query string . This type of dynamic query suggestion can help users to formulate queries that better represent their search intent during Web search interactions . In this paper , we demonstrate our query suggestion system called CONQUER , which allows to efficiently suggest queries for a given partial query and a number of available query context observations . The context-awareness allows for suggesting queries tailored to a given context , e.g. , the user location or the time of day . CONQUER uses a suggestion model that is based on the combined probabilities of sequential query patterns and context observations . For this , the weight of a context in a query suggestion can be adjusted online , for example , based on the learned user behavior or user profiles . We demonstrate the functionality of CONQUER based on 6 million queries from an AOL query log using the time of day and the country domain of the clicked URLs in the search result as context observations .

O O O O O 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 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


Reliability analysis using weighted combinational models for web-based software In the past , some researches suggested that engineers can use combined software reliability growth models ( SRGMs ) to obtain more accurate reliability prediction during testing . In this paper , three weighted combinational models , namely , equal , linear , and nonlinear weight , are proposed for reliability estimation of web-based software . We further investigate the estimation accuracy of using genetic algorithm to determine the weight assignment for the proposed models . Preliminary result shows that the linearly and nonlinearly weighted combinational models have better prediction capability than single SRGM and equally weighted combinational model for web-based software .

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

genetic algorithm.
software reliability growth model
weighted combination


Semantic navigation on the web of data : specification of routes , web fragments and actions The massive semantic data sources linked in the Web of Data give new meaning to old features like navigation ; introduce new challenges like semantic specification of Web fragments ; and make it possible to specify actions relying on semantic data . In this paper we introduce a declarative language to face these challenges . Based on navigational features , it is designed to specify fragments of the Web of Data and actions to be performed based on these data . We implement it in a centralized fashion , and show its power and performance . Finally , we explore the same ideas in a distributed setting , showing their feasibility , potentialities and challenges .

O B O O B I I 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 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 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

linked data
semantic web
systems and software


A data-driven sketch of Wikipedia editors Who edits Wikipedia ? We attempt to shed light on this question by using aggregated log data from Yahoo ! 's browser toolbar in order to analyze Wikipedians ' editing behavior in the context of their online lives beyond Wikipedia . We broadly characterize editors by investigating how their online behavior differs from that of other users ; e.g. , we find that Wikipedia editors search more , read more news , play more games , and , perhaps surprisingly , are more immersed in pop culture . Then we inspect how editors ' general interests relate to the articles to which they contribute ; e.g. , we confirm the intuition that editors show more expertise in their active domains than average users . Our results are relevant as they illuminate novel aspects of what has become many Web users ' prevalent source of information and can help in recruiting new editors .

O O O O B 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 O B O O O O O O O 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 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 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 B O


CoSi : context-sensitive keyword query interpretation on RDF databases The demo will present CoSi , a system that enables context-sensitive interpretation of keyword queries on RDF databases . The techniques for representing , managing and exploiting query history are central to achieving this objective . The demonstration will show the effectiveness of our approach for capturing a user 's querying context from their query history . Further , it will show how context is utilized to influence the interpretation of a new query . The demonstration is based on DBPedia , the RDF representation of Wikipedia .

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 O 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

keyword query interpretation
query history


Designing personalized web applications


GoGetIt ! : a tool for generating structure-driven web crawlers We present GoGetIt ! , a tool for generating structure-driven crawlers that requires a minimum effort from the users . The tool takes as input a sample page and an entry point to a Web site and generates a structure-driven crawler based on navigation patterns , sequences of patterns for the links a crawler has to follow to reach the pages structurally similar to the sample page . In the experiments we have performed , structure-driven crawlers generated by GoGetIt ! were able to collect all pages that match the samples given , including those pages added after their generation .

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


Dynamic personalized pagerank in entity-relation graphs Extractors and taggers turn unstructured text into entity-relation ( ER ) graphs where nodes are entities ( email , paper , person , conference , company ) and edges are relations ( wrote , cited,works-for ) . Typed proximity search of the form ( B ) type = personNEAR company ~ `` IBM '' , paper ~ `` XML '' ( \/ B ) is an increasingly usefulsearch paradigm in ER graphs . Proximity search implementations either perform a Pagerank-like computation at query time , which is slow , or precompute , store and combine per-word Pageranks , which can be very expensive in terms of preprocessing time and space . We present HubRank , a new system for fast , dynamic , space-efficient proximity searches in ER graphs . During preprocessing , HubRank computesand indexes certain `` sketchy '' random walk fingerprints for a small fraction of nodes , carefully chosen using query log statistics . At query time , a small `` active '' subgraph is identified , bordered bynodes with indexed fingerprints . These fingerprints are adaptively loaded to various resolutions to form approximate personalized Pagerank vectors ( PPVs ) . PPVs at remaining active nodes are now computed iteratively . We report on experiments with CiteSeer 's ER graph and millions of real Cite Seer queries . Some representative numbers follow . On our testbed , HubRank preprocesses and indexes 52 times faster than whole-vocabulary PPV computation . A text index occupies 56 MB . Whole-vocabulary PPVs would consume 102GB . If PPVs are truncated to 56 MB , precision compared to true Pagerank drops to 0.55 ; incontrast , HubRank has precision 0.91 at 63MB . HubRank 's average querytime is 200-300 milliseconds ; query-time Pagerank computation takes 11 seconds on average .

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 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


How much can behavioral targeting help online advertising ? Behavioral Targeting ( BT ) is a technique used by online advertisers to increase the effectiveness of their campaigns , and is playing an increasingly important role in the online advertising market . However , it is underexplored in academia when looking at how much BT can truly help online advertising in commercial search engines . To answer this question , in this paper we provide an empirical study on the click-through log of advertisements collected from a commercial search engine . From the comprehensively experiment results on the sponsored search log of the commercial search engine over a period of seven days , we can draw three important conclusions : ( 1 ) Users who clicked the same ad will truly have similar behaviors on the Web ; ( 2 ) Click-Through Rate ( CTR ) of an ad can be averagely improved as high as 670 % by properly segmenting users for behavioral targeted advertising in a sponsored search ; ( 3 ) Using the short term user behaviors to represent users is more effective than using the long term user behaviors for BT . The statistical t-test verifies that all conclusions drawn in the paper are statistically significant . To the best of our knowledge , this work is the first empirical study for BT on the click-through log of real world ads .

O O O B I 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 O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

click-through rate .
model validation and analysis
user segmentation


An XPath-based preference language for P3P The Platform for Privacy Preferences ( P3P ) is the most significant effort currently underway to enable web users to gain control over their private information . The designers of P3P simultaneously designed a preference language called APPEL to allow users to express their privacy preferences , thus enabling automatic matching of privacy preferences against P3P policies . Unfortunately subtle interactions between P3P and APPEL result in serious problems when using APPEL : Users can only directly specify what is unacceptable in a policy , not what is acceptable ; simple preferences are hard to express ; and writing APPEL preferences is error prone . We show that these problems follow from a fundamental design choice made by APPEL , and can not be solved without completely redesigning the language . Therefore we explore alternatives to APPEL that can overcome these problems . In particular , we show that XPath serves quite nicely as a preference language and solves all the above problems . We identify the minimal subset of XPath that is needed , thus allowing matching programs to potentially use a smaller memory footprint . We also give an APPEL to XPath translator that shows that XPath is as expressive as APPEL .

O O B 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 B O O O B O O B 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 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 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 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 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 B O B O O O O B O O O O B O

hippocratic databases
privacy-aware data management
xpref


Determining the user intent of web search engine queries Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher . In this paper , we examine a method to determine the user intent underlying Web search engine queries . We qualitatively analyze samples of queries from seven transaction logs from three different Web search engines containing more than five million queries . From this analysis , we identified characteristics of user queries based on three broad classifications of user intent . The classifications of informational , navigational , and transactional represent the type of content destination the searcher desired as expressed by their query . We implemented our classification algorithm and automatically classified a separate Web search engine transaction log of over a million queries submitted by several hundred thousand users . Our findings show that more than 80 % of Web queries are informational in nature , with about 10 % each being navigational and transactional . In order to validate the accuracy of our algorithm , we manually coded 400 queries and compared the classification to the results from our algorithm . This comparison showed that our automatic classification has an accuracy of 74 % . Of the remaining 25 % of the queries , the user intent is generally vague or multi-faceted , pointing to the need to for probabilistic classification . We illustrate how knowledge of searcher intent might be used to enhance future Web search engines .

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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O


Using annotations in enterprise search A major difference between corporate intranets and the Internet is that in intranets the barrier for users to create web pages is much higher . This limits the amount and quality of anchor text , one of the major factors used by Internet search engines , making intranet search more difficult . The social phenomenon at play also means that spam is relatively rare . Both on the Internet and in intranets , users are often willing to cooperate with the search engine in improving the search experience . These characteristics naturally lead to considering using user feedback to improve search quality in intranets . In this paper we show how a particular form of feedback , namely user annotations , can be used to improve the quality of intranet search . An annotation is a short description of the contents of a web page , which can be considered a substitute for anchor text . We propose two ways to obtain user annotations , using explicit and implicit feedback , and show how they can be integrated into a search engine . Preliminary experiments on the IBM intranet demonstrate that using annotations improves the search quality .

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

anchortext
community ranking
information search and retrieval


Csurf : a context-driven non-visual web-browser Web sites are designed for graphical mode of interaction . Sighted users can `` cut to the chase '' and quickly identify relevant information in Web pages . On the contrary , individuals with visual disabilities have to use screen-readers tobrowse the Web . As screen-readers process pages sequentially and read through everything , Web browsing can become strenuous and time-consuming . Although , the use ofshortcuts and searching offers some improvements , the problem still remains . In this paper , we address the problemof information overload in non-visual Web access using thenotion of context . Our prototype system , CSurf , embodyingor approach , provides the usual features of a screen-reader . However , when a user follows a link , CSurf captures thecontext of the link using a simple topic-boundary detectiontechnique , and uses it to identify relevant information onthe next page with the help of a Support Vector Machine , astatistical machine-learning model . Then , CSurf reads the Web page starting from the most relevant section , identifiedby the model . We conducted a series experiments to evaluate the performance of CSurf against the state-of-the-artscreen-reader , JAWS . Our results show that the use of context can potentially save browsing time and substantiallyimprove browsing experience of visually disabled people .

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 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 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 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 O

hearsay
hypertext/hypermedia
non-visual
partitioning
screen-reader
semantic blocks
user interfaces
voice browser
web accessibility


Exception handling in workflow-driven Web applications As the Web becomes a platform for implementing B2B applications , the need arises of Web conceptual models for describing Web oriented workflow applications implementing business processes . In this context , new problems about process correctness arise , due to the loose control of Web applications upon the behavior of their Web clients . Indeed , incoherent user 's behavior can lead to inconsistent processes . This paper presents a high level approach to the management of exceptions that occur during the execution of processes on the Web . We present a classification of exceptions that can be raised inside workflow-driven Web applications , and recovery policies to retrieve coherent status and data after an exception . We devise these concepts at high level and then we exploit them using a Web modeling language ( WebML ) that in turn provides development facilities like automatic code generation , validation of hypertext models , and so on . An industrial implementation experience is briefly presented too .

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 B 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 B O O O O O 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 O O O O O O O O O O O O O O O O O O O O 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-aided software engineering
failure
navigation behavior


Automatically learning document taxonomies for hierarchical classification While several hierarchical classification methods have been applied to web content , such techniques invariably rely on a pre-defined taxonomy of documents . We propose a new technique that extracts a suitable hierarchical structure automatically from a corpus of labeled documents . We show that our technique groups similar classes closer together in the tree and discovers relationships among documents that are not encoded in the class labels . The learned taxonomy is then used along with binary SVMs for multi-class classification . We demonstrate the efficacy of our approach by testing it on the 20-Newsgroup dataset .

O O O O O B I 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

automatic taxonomy learning
content analysis and indexing
information search and retrieval


Semantic search of schema repositories


Can link analysis tell us about web traffic ? In this paper we measure correlation between link analysis characteristics for Web pages such as in - and out-degree , PageRank and RBS with those obtained from real Web traffic analysis . Measurements made on real data from the Polish Web show that PageRank is observably but not strongly correlated with actual visits made by Web users to Web pages and that our RBS algorithm ( 2 ) is more correlated with traffic data than PageRank in some cases .

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 B O B O O O O O B I 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 B O O O O O O O O O O O B O O O O

link analysis
pagerank
rbs
web traffic analysis


Releasing search queries and clicks privately The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned , but privacy-unaware AOL search log release . Since then a series of ad-hoc techniques have been proposed in the literature , though none are known to be provably private . In this paper , we take a major step towards a solution : we show how queries , clicks and their associated perturbed counts can be published in a manner that rigorously preserves privacy . Our algorithm is decidedly simple to state , but non-trivial to analyze . On the opposite side of privacy is the question of whether the data we can safely publish is of any use . Our findings offer a glimmer of hope : we demonstrate that a non-negligible fraction of queries and clicks can indeed be safely published via a collection of experiments on a real search log . In addition , we select an application , keyword generation , and show that the keyword suggestions generated from the perturbed data resemble those generated from the original data .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 release
differential privacy
query click graph
search logs
security, integrity, and protection


Mining photo-sharing websites to study ecological phenomena The popularity of social media websites like Flickr and Twitter has created enormous collections of user-generated content online . Latent in these content collections are observations of the world : each photo is a visual snapshot of what the world looked like at a particular point in time and space , for example , while each tweet is a textual expression of the state of a person and his or her environment . Aggregating these observations across millions of social sharing users could lead to new techniques for large-scale monitoring of the state of the world and how it is changing over time . In this paper we step towards that goal , showing that by analyzing the tags and image features of geo-tagged , time-stamped photos we can measure and quantify the occurrence of ecological phenomena including ground snow cover , snow fall and vegetation density . We compare several techniques for dealing with the large degree of noise in the dataset , and show how machine learning can be used to reduce errors caused by misleading tags and ambiguous visual content . We evaluate the accuracy of these techniques by comparing to ground truth data collected both by surface stations and by Earth-observing satellites . Besides the immediate application to ecology , our study gives insight into how to accurately crowd-source other types of information from large , noisy social sharing datasets .

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 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


Tag clouds for summarizing web search results In this paper , we describe an application , PubCloud that uses tagclouds for the summarization of results from queries over thePubMed database of biomedical literature . PubCloud responds toqueries of this database with tag clouds generated from wordsextracted from the abstracts returned by the query . The results ofa user study comparing the PubCloud tag-cloud summarization ofquery results with the standard result list provided by PubMedindicated that the tag cloud interface is advantageous in presenting descriptive information and in reducing user frustrationbut that it is less effective at the task of enabling users to discoverrelations between concepts .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

content summarization
literature search
natural language processing
pubmed
tagging
text mining
visualization


Sitemaps : above and beyond the crawl of duty Comprehensive coverage of the public web is crucial to web search engines . Search engines use crawlers to retrieve pages and then discover new ones by extracting the pages ' outgoing links . However , the set of pages reachable from the publicly linked web is estimated to be significantly smaller than the invisible web , the set of documents that have no incoming links and can only be retrieved through web applications and web forms . The Sitemaps protocol is a fast-growing web protocol supported jointly by major search engines to help content creators and search engines unlock this hidden data by making it available to search engines . In this paper , we perform a detailed study of how `` classic '' discovery crawling compares with Sitemaps , in key measures such as coverage and freshness over key representative websites as well as over billions of URLs seen at Google . We observe that Sitemaps and discovery crawling complement each other very well , and offer different tradeoffs .

B O O O O O O O O O O O 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 O O O O O O O O O O O O O O O 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 B I O O O O O B I 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 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 B O O B O O O O O O O O O O O


The million song dataset challenge We introduce the Million Song Dataset Challenge : a large-scale , personalized music recommendation challenge , where the goal is to predict the songs that a user will listen to , given both the user 's listening history and full information ( including meta-data and content analysis ) for all songs . We explain the taste profile data , our goals and design choices in creating the challenge , and present baseline results using simple , off-the-shelf recommendation algorithms .

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

miscellaneous
music information retrieval
recommender systems


Expressiveness of XSDs : from practice to theory , there and back again On an abstract level , XML Schema increases the limited expressive power of Document Type Definitions ( DTDs ) by extending them with a recursive typing mechanism . However , an investigation of the XML Schema Definitions ( XSDs ) occurring in practice reveals that the vast majority of them are structurally equivalent to DTDs . This might be due to the complexity of the XML Schema specification and the difficulty to understand the effect of constraints on typing and validation of schemas . To shed some light on the actual expressive power of XSDs this paper studies the impact of the Element Declarations Consistent ( EDC ) and the Unique Particle Attribution ( UPA ) rule . An equivalent formalism based on contextual patterns rather than on recursive types is proposed which might serve as a light-weight front end for XML Schema . Finally , the effect of EDC and UPA on the way XML documents can be typed is discussed . It is argued that a cleaner , more robust , stronger but equally efficient class is obtained by replacing EDC and UPA with the notion of 1-pass preorder typing : schemas that allow to determine the type of an element of a streaming document when its opening tag is met . This notion can be defined in terms of restrained competition regular expressions and there is again an equivalent syntactical formalism based on contextual patterns .

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 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 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 O O O O O O O O O O O O O


Conceptual linking : ontology-based open hypermedia

hypertext/hypermedia
link service
metadata
navigation
ontology


Matching web site structure and content To keep an overview of a complex corporate web sites , it is crucial to understand the relationship of contents , structure and the user 's behavior . In this paper , we describe an approach which is allowing us to compare web page content with the information implictly defined by the structure of the web site . We start by describing each web page with a set of key words . We combine this information with the link structure in an algorithm generating a context based description . By comparing both descriptions , we draw conclusions about the semantic relationship of a web page and its neighborhood . In this way , we indicate whether a page fits in the content of its neighborhood . Doing this , we implicitly identify topics which span over several connected web pages . With our approach we support redesign processes by assessing the actual structure and content of a web site with designer 's concepts .

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

applications
information search and retrieval
semantic description
web content mining
web structure


Mining multilingual topics from wikipedia In this paper , we try to leverage a large-scale and multilingual knowledge base , Wikipedia , to help effectively analyze and organize Web information written in different languages . Based on the observation that one Wikipedia concept may be described by articles in different languages , we adapt existing topic modeling algorithm for mining multilingual topics from this knowledge base . The extracted ` universal ' topics have multiple types of representations , with each type corresponding to one language . Accordingly , new documents of different languages can be represented in a space using a group of universal topics , which makes various multilingual Web applications feasible .

O B O O B O O O O O O O O O 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 B O O O O O O O O O O O O O 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 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

content analysis and indexing
universal-topics


Site level noise removal for search engines The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their web sites . At the same time , the growth of the web has also inherently generated several navigational hyperlink structures that have a negative impact on the importance measures employed by current search engines . In this paper we propose and evaluate algorithms for identifying all these noisy links on the web graph , may them be spam or simple relationships between real world entities represented by sites , replication of content , etc. . Unlike prior work , we target a different type of noisy link structures , residing at the site level , instead of the page level . We thus investigate and annihilate site level mutual reinforcement relationships , abnormal support coming from one site towards another , as well as complex link alliances between web sites . Our experiments with the link database of the TodoBR search engine show a very strong increase in the quality of the output rankings after having applied our techniques .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

information search and retrieval
link analysis
noise reduction
pagerank


Ontalk : ontology-based personal document management system In this paper , we present our development of a document management and retrieval tool , which is named Ontalk . Our system provides a semi-automatic metadata generator and an ontology-based search engine for electronic documents . Ontalk can create or import various ontologies in RDFS or OWL for describing the metadata . Our system that is built upon . NET technology is easily communicated with or flexibly plugged into many different programs .

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

inference etc.
knowledge management
ontology


Annotea : an open RDF infrastructure for shared Web annotations

metadata
semantic web
world-wide web
xml
xpointer


Interpreting distributed ontologies Semantic Web is challenged by the URI meaning issues arising from putting ontologies in open and distributed environments . As a try to clarify some of the meaning issues , this paper proposes a new approach to interpreting distributed ontologies , it 's built on the top of local models semantics , and extends it to deal with the URI sharing by harmonizing the local models via agreement on vocabulary provenance . The commitment relationship is presented to allow the URI sharing between ontologies with richer semantics .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O

commitment relationship
vocabulary provenance


sTeam - Designing an integrative infrastructure for Web-based computer-supported cooperative learning

steam - structuring information in a team


Multi-step media adaptation : implementation of a knowledge-based engine Continuing changes in the domains of consumer devices and multimedia formats demand for a new approach to media adaptation . The publication of customized content on a device requires an automatic adaptation engine that takes into account the specifications of both the device and the material to be published . These specifications can be expressed using a single domain ontology that describes the concepts of the media adaptation domain . In this document , we provide insight into the implementation of an adaptation engine that exploits this domain knowledge . We explain how this engine , through the use of description matching and Semantic Web Services , composes a chain of adaptation services which will alter the original content to the needs of the target device .

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 B I B O O O O O O B O O O O O O O O O O O O O O

content adaptation
device independence
owl
standards


Practical end-to-end web content integrity Widespread growth of open wireless hotspots has made it easy to carry out man-in-the-middle attacks and impersonate web sites . Although HTTPS can be used to prevent such attacks , its universal adoption is hindered by its performance cost and its inability to leverage caching at intermediate servers ( such as CDN servers and caching proxies ) while maintaining end-to-end security . To complement HTTPS , we revive an old idea from SHTTP , a protocol that offers end-to-end web integrity without confidentiality . We name the protocol HTTPi and give it an efficient design that is easy to deploy for today 's web . In particular , we tackle several previously-unidentified challenges , such as supporting progressive page loading on the client 's browser , handling mixed content , and defining access control policies among HTTP , HTTPi , and HTTPS content from the same domain . Our prototyping and evaluation experience show that HTTPi incurs negligible performance overhead over HTTP , can leverage existing web infrastructure such as CDNs or caching proxies without any modifications to them , and can make many of the mixed-content problems in existing HTTPS web sites easily go away . Based on this experience , we advocate browser and web server vendors to adopt HTTPi .

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 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 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


Topic initiator detection on the world wide web In this paper we introduce a new Web mining and search technique - Topic Initiator Detection ( TID ) on the Web . Given a topic query on the Internet and the resulting collection of time-stamped web documents which contain the query keywords , the task of TID is to automatically return which web document ( or its author ) initiated the topic or was the first to discuss about the topic . To deal with the TID problem , we design a system framework and propose algorithm InitRank ( Initiator Ranking ) to rank the web documents by their possibility to be the topic initiator . We first extract features from the web documents and design several topic initiator indicators . Then , we propose a TCL graph which integrates the Time , Content and Link information and design an optimization framework over the graph to compute InitRank . Experiments show that compared with baseline methods , such as direct time sorting , well-known link based ranking algorithms PageRank and HITS , InitRank achieves the best overall performance with high effectiveness and robustness . In case studies , we successfully detected ( 1 ) the first web document related to a famous rumor of an Australia product banned in USA and ( 2 ) the pre-release of IBM and Google Cloud Computing collaboration before the official announcement .

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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


Consistency-preserving caching of dynamic database content With the growing use of dynamic web content generated from relational databases , traditional caching solutions for through put and latency improvements are ineffective . We describe a middleware layer called Ganesh that reduces the volume of data transmitted without semantic interpretation of queries or results . It achieves this reduction through the use of cryptographic hashing to detect similarities with previous results . These benefits do not require any compromise of the strict consistency semantics provided by the back-end database . Further , Ganesh does not require modifications to applications , web servers , or database servers , and works with closed-source applications and databases . Using two bench marks representative of dynamic web sites , measurements of our prototype show that it can increase end-to-end throughput by as much as two fold for non-data intensive applications and by as much as ten fold for dataintensive ones .

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

bandwidth optimization
content addressable storage
database caching
distributed systems
relational database systems
systems
wide area networks


Educanext : a framework for sharing live educational resources with isabel EducaNext is an educational mediator created within the UNIVERSAL IST Project which supports both , the exchange of reusable educational materials based on open standards , as well as the collaboration of educators over the network in the realization of educational activities . The Isabel CSCW application is a group collaboration tool for the Internet supporting audience interconnection over the network , such as distributed classrooms , conferences or meetings . This paper describes the conclusions and feedback obtained from the integration of Isabel into EducaNext , it 's use for the realization of collaborative educational activities involving distributed classrooms , lectures or workshops , as well as the general conclusions obtained about the integration of synchronous collaboration applications into educational mediators .

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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O

educational activity
ieee standard
isabel application
learning resource
live collaboration over the internet
lom
videoconferencing


Shout out : integrating news and reader comments A useful approach for enabling computers to automatically create new content is utilizing the text , media , and information already present on the World Wide Web . The newly created content is known as `` machine-generated content '' . For example , a machine-generated content system may create a multimedia news show with two animated anchors presenting a news story ; one anchor reads the news story with text taken from an existing news article , and the other anchor regularly interrupts with his or her own opinion about the story . In this paper , we present such a system , and describe in detail its strategy for autonomously extracting and selecting the opinions given by the second anchor .

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

cosine similarity
emotional valence detection
machine-generated content


Fast and parallel webpage layout The web browser is a CPU-intensive program . Especially on mobile devices , webpages load too slowly , expending significant time in processing a document 's appearance . Due to power constraints , most hardware-driven speedups will come in the form of parallel architectures . This is also true of mobile devices such as phones and e-books . In this paper , we introduce new algorithms for CSS selector matching , layout solving , and font rendering , which represent key components for a fast layout engine . Evaluation on popular sites shows speedups as high as 80x . We also formulate the layout problem with attribute grammars , enabling us to not only parallelize our algorithm but prove that it computes in O ( log ) time and without reflow .

O 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 O O O O O B O O O O O O O O O O O O O O O O B B O O B 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 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

attribute grammar
box model
graphical user interfaces
html
multicore


Spam double-funnel : connecting web spammers with advertisers Spammers use questionable search engine optimization ( SEO ) techniques to promote their spam links into top search results . In this paper , we focus on one prevalent type of spam - redirection spam - where one can identify spam pages by the third-party domains that these pages redirect traffic to . We propose a five-layer , double-funnel model for describing end-to-end redirection spam , present a methodology for analyzing the layers , and identify prominent domains on each layer using two sets of commercial keywords . one targeting spammers and the other targeting advertisers . The methodology and findings are useful for search engines to strengthen their ranking algorithms against spam , for legitimate website owners to locate and remove spam doorway pages , and for legitimate advertisers to identify unscrupulous syndicators who serve ads on spam pages .

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

advertisement syndication
redirection and cloaking
search spam
web spam


A semantic approach for designing business protocols Business processes involve interactions among autonomous partners . We propose that these interactions be specified modularly as protocols . Protocols can be published , enabling implementors to independently develop components that respect published protocols and yet serve diverse interests . A variety of business protocols would be needed to capture subtle business needs . We propose that the same kinds of conceptual abstractions be developed for protocols as for information models . Specifically , we consider ( 1 ) refinement : a subprotocol may satisfy the requirements of a superprotocol , but support additional properties and ( 2 ) aggregation : a protocol may combine existing protocols . In support of the above , we develop a formal semantics for protocols , an operational characterization of them , and an algebra for protocol 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

business process composition
commitments
web services