OpenRaiser/Intern-Atlas huggingface dataset:
Workshop on social web and knowledge management (SWKM2008)
Authors: Peter Dolog, Markus Krötzsch, Sebastian Schaffert, Denny Vrandecic
Venue: WWW
Year: 2008

This paper provides an overview on the synergies between social web and knowledge managemen, topics, program committee members as well as summary of accepted papers for the SWKM2008 workshop.
First workshop on targeting and ranking for online advertising
Authors: Ewa Dominowska, Vanja Josifovski
Venue: WWW
Year: 2008

Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Online advertising providers use sophisticated ad targeting and ranking algorithms with the dual aim of maximizing revenue while providing a superior user experience. As a result, advertising optimization is a very complex research problem, since it combines relevance with user interaction models, advertiser valuations, and commercial constraints. Online advertising integrates a number of core research areas: machine learning, data mining, search, auction theory, and user modeling.
A semantic layer for publishing and localizing xml data for a p2p xquery mediator
Authors: Florin Dragan, Georges Gardarin, Laurent Yeh
Venue: WWW
Year: 2008

In this poster, we present the P2P XML data localization layer of XLive, an XQuery mediation system developed at University of Versailles [2]. A major challenge in the evaluation of XQuery over a P2P network in the context of multiple XML sources is to abstract from structural heterogeneity. Most existing approaches have mainly exploited varied types of 1:1 semantic mappings between peer schemas and/or ontologies. Complex query algorithms are required to exploit these semantic links between peers. In contrast, our approach focuses on a simple semantic layer. It is built on a Chord [4] DHT for indexing semantic descriptions of mediated data sources. A mapping process transforms an XML view of a mediator (each peer is equipped with a mediator) to a semantic form that is published into the P2P network and stored in the DHT. For a given user query, a search in the DHT retrieves all relevant data sources able to contribute to the result elaboration. Then, every peer that contains relevant data is directly queried to collect data for elaborating the final answer.
Dtwiki: a disconnection and intermittency tolerant wiki
Authors: Bowei Du, Eric A. Brewer
Venue: WWW
Year: 2008

Wikis have proven to be a valuable tool for collaboration and content generation on the web. Simple semantics and ease-of-use make wiki systems well suited for meeting many emerging region needs in the areas of education, collaboration and local content generation. Despite their usefulness, current wiki software does not work well in the network environments found in emerging regions. For example, it is common to have long-lasting network partitions due to cost, power and poor connectivity. Network partitions make a traditional centralized wiki architecture unusable due to the unavailability of the central server. Existing solutions towards addressing connectivity problems include web-caching proxies and snapshot distribution. While proxies and snapshots allow wiki data to be read while disconnected, they prevent users from contributing updates back to the wiki.
Computing minimum cost diagnoses to repair populated DL-based ontologies
Authors: Jianfeng Du, Yi-Dong Shen
Venue: WWW
Year: 2008

Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the intensional part of the populated DL-based ontology is fixed and each removable ABox assertion is given a removal cost, we repair the ontology by deleting a subset of removable ABox assertions in which the sum of removal costs is minimum. We call such subset a minimum cost diagnosis. We show that, unless P=NP, the problem of finding a minimum cost diagnosis for a DL-Lite ontology is insolvable in PTIME w.r.t. data complexity. In spite of that, we present a feasible computational method for more general (i.e. SHIQ) ontologies. It transforms a SHIQ ontology to a set of disjoint propositional programs, thus reducing the original problem into a set of independent subproblems. Each such subproblem computes an optimal model and is solvable in logarithmic calls to a SAT solver. Experimental results show that the method can handle moderately complex ontologies with over thousands of ABox assertions, where all ABox assertions can be assumed removable.
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
Authors: Masaya Eki, Tadachika Ozono, Toramatsu Shintani
Venue: WWW
Year: 2008

We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type a large collection of XML approximately but efficiently. This can also process XML code written in a different schema or even code which is schema-less. Our approach is intended to achieve identification based on the syntax and semantics of the XML documents by information extraction using ontology, and to support retrieval and data management. Our approach has three steps. The first step is XML to predicates, the second step is to compare predicates and classifies structures which represent similar meanings in different structures, and the last step is predicates to rules by using ontology and to maintain XML Schema. We evaluate similarity of data type and data range by using an ontology dictionary, and XML Schema is made from results of second and last step.
Application of bitmap index to information retrieval
Authors: Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
Venue: WWW
Year: 2008

We developed the HS-bitmap index for efficient information retrieval. The HS-bitmap index is a hierarchical document-term matrix: the original document-term matrix is called the leaf matrix and an upper matrix is the summary of its lower matrix. Our experiment results show the HS-bitmap index performs better than the inverted index with a minor space overhead.
Mining tag clouds and emoticons behind community feedback
Authors: Kavita A. Ganesan, Neelakantan Sundaresan, Harshal Deo
Venue: WWW
Year: 2008

In this paper we describe our mining system which automatically mines tags from feedback text in an eCommerce scenario. It renders these tags in a visually appealing manner. Further, emoticons are attached to mined tags to add sentiment to the visual aspect.
Efficient mining of frequent sequence generators
Authors: Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
Venue: WWW
Year: 2008

Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent sequence generator mining. In this paper we present a novel algorithm, FEAT (abbr. Frequent sEquence generATor miner), to perform this task. Ex-perimental results show that FEAT is more efficient than traditional sequential pattern mining algorithms but generates more concise re-sult set, and is very effective for classifying Web product reviews.
Personalized tag suggestion for flickr
Authors: Nikhil Garg, Ingmar Weber
Venue: WWW
Year: 2008

We present a system for personalized tag suggestion for Flickr: While the user is entering/selecting new tags for a particular picture, the system is suggesting related tags to her, based on the tags that she or other people have used in the past along with (some of) the tags already entered. The suggested tags are dynamically updated with every ad-ditional tag entered/selected. We describe three algorithms which can be applied to this problem. In experiments, our best-performing method yields an improvement in precision of 10-15 % over a baseline method very similar to the sys-tem currently used by Flickr. Our system is accessible at
Organizing and sharing distributed personal web-service data
Authors: Roxana Geambasu, Cherie Cheung, Alexander Moshchuk, Steven D. Gribble, Henry M. Levy
Venue: WWW
Year: 2008

The migration from desktop applications to Web-based services is scattering personal data across a myriad of Web sites, such as Google, Flickr, YouTube, and Amazon S3. This dispersal poses new challenges for users, making it more difficult for them to: (1) organize, search, and archive their data, much of which is now hosted by Web sites; (2) create heterogeneous, multi-Web-service object collections and share them in a protected way; and (3) manipulate their data with standard applications or scripts.
Improving web spam detection with re-extracted features
Authors: Guanggang Geng, Chunheng Wang, Qiudan Li
Venue: WWW
Year: 2008

Web spam detection has become one of the top challenges for the Internet search industry. Instead of using some heuristic rules, we propose a feature re-extraction strategy to optimize the detection result. Based on the predicted spamicity obtained by the preliminary detection, through the host level web graph, three types of features are extracted. Experiments on WEBSPAM-UK2006 benchmark show that with this strategy, the performance of web spam detection can be improved evidently. Categories and Subject Descriptors
Analyzing search engine advertising: firm behavior and cross-selling in electronic markets
Authors: Anindya Ghose, Sha Yang
Venue: WWW
Year: 2008

The phenomenon of sponsored search advertising is gaining ground as the largest source of revenues for search engines. Firms across different industries have are beginning to adopt this as the primary form of online advertising. This process works on an auction mechanism in which advertisers bid for different keywords, and final rank for a given keyword is allocated by the search engine. But how different are firm's actual bids from their optimal bids? Moreover, what are other ways in which firms can potentially benefit from sponsored search advertising? Based on the model and estimates from prior work [10], we conduct a number of policy simulations in order to investigate to what extent an advertiser can benefit from bidding optimally for its keywords. Further, we build a Hierarchical Bayesian modeling framework to explore the potential for cross-selling or spillovers effects from a given keyword advertisement across multiple product categories, and estimate the model using Markov Chain Monte Carlo (MCMC) methods. Our analysis suggests that advertisers are not bidding optimally with respect to maximizing profits. We conduct a detailed analysis with product level variables to explore the extent of cross-selling opportunities across different categories from a given keyword advertisement. We find that there exists significant potential for cross-selling through search keyword advertisements in that consumers often end up buying products from other categories in addition to the product they were searching for. Latency (the time it takes for consumer to place a purchase order after clicking on the advertisement) and the presence of a brand name in the keyword are associated with consumer spending on product categories that are different from the one they were originally searching for on the Internet.
Mashups for semantic user profiles
Authors: Riddhiman Ghosh, Mohamed Dekhil
Venue: WWW
Year: 2008

In this paper, we discuss challenges and provide solutions for capturing and maintaining accurate models of user profiles using semantic web technologies, by aggregating and sharing distributed fragments of user profile information spread over multiple services. Our framework for profile management allows for evolvable, extensible and expressive user profiles. We have implemented a prototype, targeting the retail domain, on the HP Labs Retail Store Assistant.
Statistical analysis of the social network and discussion threads in slashdot
Authors: Vicenç Gómez, Andreas Kaltenbrunner, Vicente López
Venue: WWW
Year: 2008

We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant component, small average path length and high clustering, but differs from them showing moderate reciprocity and neutral assortativity by degree. Using Kolmogorov-Smirnov statistical tests, we show that the degree distributions are better explained by log-normal instead of power-law distributions. We also study the structure of discussion threads using an intuitive radial tree representation. Threads show strong heterogeneity and self-similarity throughout the different nesting levels of a conversation. We use these results to propose a simple measure to evaluate the degree of controversy provoked by a post.
Matching independent global constraints for composite web services
Authors: Nalaka Gooneratne, Zahir Tari
Venue: WWW
Year: 2008

Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall than syntactic-based ones (as they employ ontological reasoning mechanisms to match syntactically heterogeneous descriptions). However, semantic-based approaches still have problems (e.g. lack of scalability as an exhaustive search is often performed to located services conforming to constraints). This paper proposes two approaches that deal with the problem of scalability/performance for composite service location. First, services are indexed based on the values they assign to their restricted attributes (the attributes restricted by a given constraint). Then, services that assign "conforming values" to those attributes are combined to form composite services. The first proposed approach extends a local optimisation technique to perform the latter, since identifying such values is NP-hard. However, this approach returns false negatives since the local optimisation technique does not consider all the values. Hence, a second approach that derives conforming values using domain rules is defined. The used rules are returned with each composite service so that a user can understand the context in which it is retrieved. Results obtained from the experiments that varied the number of available services demonstrate that the performance of the local optimisation-based approach is 76% better than existing semantic-based approaches and recall is 98% higher than syntactic-based approaches.
Plurality: a context-aware personalized tagging system
Authors: Robert Graham, Brian Eoff, James Caverlee
Venue: WWW
Year: 2008

We present the design of Plurality, an interactive tagging system. Plurality's modular architecture allows users to automatically generate high-quality tags over Web content, as well as over archival and personal content typically beyond the reach of existing Web 2.0 social tagging systems. Three of the salient features of Plurality are: (i) its self-learning and feedback-sensitive capabilities based on a user's personalized tagging style; (ii) its leveraging of the collective intelligence of existing social tagging services; and (iii) its context-awareness for optimizing tag suggestions, e.g., based on spatial or temporal features.
Secure or insure?: a game-theoretic analysis of information security games
Authors: Jens Grossklags, Nicolas Christin, John Chuang
Venue: WWW
Year: 2008

Despite general awareness of the importance of keeping one's system secure, and widespread availability of consumer security technologies, actual investment in security remains highly variable across the Internet population, allowing attacks such as distributed denial-of-service (DDoS) and spam distribution to continue unabated. By modeling security investment decision-making in established (e.g., weakest-link, best-shot) and novel games (e.g., weakest-target), and allowing expenditures in self-protection versus self-insurance technologies, we can examine how incentives may shift between investment in a public good (protection) and a private good (insurance), subject to factors such as network size, type of attack, loss probability, loss magnitude, and cost of technology. We can also characterize Nash equilibria and social optima for different classes of attacks and defenses. In the weakest-target game, an interesting result is that, for almost all parameter settings, more effort is exerted at Nash equilibrium than at the social optimum. We may attribute this to the "strategic uncertainty" of players seeking to self-protect at just slightly above the lowest protection level.
Compoweb: a component-oriented web architecture
Authors: Rui Guo, Bin B. Zhu, Min Feng, Aimin Pan, Bosheng Zhou
Venue: WWW
Year: 2008

In this paper, client-site Web mashups are studied from component-oriented perspective, and CompoWeb, a component-oriented Web architecture, is proposed. In CompoWeb, a Web application is decomposed into Web components called gadgets. A gadget is an abstraction of functional or logical Web component. It is isolated from other gadgets for security and reliability. Contract-based channels are the only way to interact with each other. An abstraction of contract-based channels supported or required by a gadget is also presented. It enables binding of gadgets at deployment, and promotes interchangeable gadgets. Unlike the model of a normal function call where the function logic is executed in caller's context, CompoWeb ensures that the function logic is executed in callee's context so that both the caller and callee are protected. Implementation of a prototype CompoWeb system and its performance are also presented.
Fast algorithms for topk personalized pagerank queries
Authors: Manish S. Gupta, Amit Pathak, Soumen Chakrabarti
Venue: WWW
Year: 2008

In entity-relation (ER) graphs (V,E), nodes V represent typed entities and edges E represent typed relations. For dynamic personalized PageRank queries, nodes are ranked by their steady-state probabilities obtained using the standard random surfer model. In this work, we propose a framework to answer top-k graph conductance queries. Our top-k ranking technique leads to a 4X speedup, and overall, our system executes queries 200-1600X faster than whole-graph PageRank. Some queries might contain hard predicates i.e. predicates that must be satisfied by the answer nodes. E.g. we may seek authoritative papers on public key cryptography, but only those written during 1997. We extend our system to handle hard predicates. Our system achieves these substantial query speedups while consuming only 10-20% of the space taken by a regular text index.
Ajax for mobility: mobileweaver ajax framework
Authors: Louenas Hamdi, Huaigu Wu, Serhan Dagtas, Abdelghani Benharref
Venue: WWW
Year: 2008

This paper provides a brief description of a research project on using Ajax to enhance mobile Web applications for enterprise use. The project, known as MobileWeaver Ajax Framework, leverages enterprise SOA (Service Oriented Architecture) and the latest web technologies on mobile devices.
A new aggregation policy for RSS services
Authors: Young Geun Han, Sang Ho Lee, Jae Hwi Kim, Yanggon Kim
Venue: WWW
Year: 2008

RSS is the XML-based format for syndication of Web contents, and users aggregate RSS feeds with RSS feed aggregators. There are RSS aggregation policies that help aggregate RSS feeds effectively. In this paper, we first propose an aggregation policy to minimize the number of missing postings within an aggregation. Second, we analyze and compare our aggregation policy with existing aggregation policies. Our analysis reveals that our aggregation policy can reduce approximately 23% of the missing posts in comparison with an existing policy while it increases only 6% of the aggregation delay.
Speeding up web service composition with volatile external information
Authors: John Harney, Prashant Doshi
Venue: WWW
Year: 2008

Existing methods for composing Web services assume that compositions are fixed. However, in practice, service environments are often volatile and parameters of participating services may change during the composition. This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive is compared to previous state-of-the-art approaches for Web service composition in volatile environments. We show empirically that the informed-presumptive strategy produces compositions in significantly less time than the other strategies with lesser backtracks.
Speeding up web service composition with volatile information
Authors: John Harney, Prashant Doshi
Venue: WWW
Year: 2008

This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive, is compared to previous state-of-the-art approaches for Web service composition in volatile environments. We show empirically that the informed-presumptive strategy produces compositions in significantly less time than the other strategies with lesser backtracks.
Defection detection: predicting search engine switching
Authors: Allison P. Heath, Ryen W. White
Venue: WWW
Year: 2008

Searchers have a choice about which Web search engine they use when looking for information online. If they are unsuccessful on one engine, users may switch to a different engine to continue their search. By predicting when switches are likely to occur, the search experience can be modified to retain searchers or ensure a quality experience for incoming searchers. In this poster, we present research on a technique for predicting search engine switches. Our findings show that prediction is possible at a reasonable level of accuracy, particularly when personalization or user grouping is employed. These findings have implications for the design of applications to support more effective online searching.
Online change detection in individual web user behaviour
Authors: Peter Hofgesang, Jan Peter Patist
Venue: WWW
Year: 2008

Based on our field studies and consultations with field experts, we identified three main problems that are of key importance to online web personalization and customer relationship management: 1) detecting changes in individual behaviour, 2) reporting on user actions that may need special care, and 3) detecting changes in visitation frequency.
Exploiting semantic web technologies to model web form interactions
Authors: Wolfgang Holzinger, Bernhard Krüpl, Robert Baumgartner
Venue: WWW
Year: 2008

Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for commercial meta-search engines, which still have to rely on hand crafted code and are hard to maintain.
Influencers and their barriers to technology
Authors: Ann Hsieh, Todd Hausman, Nerija Titus
Venue: WWW
Year: 2008

Modern Day Marco Polos, young influencers in emerging markets who have more access to technology than their peers, often act as the gateway to new websites and technology in their respective countries. However, as they influence their peers through account gifting, they are often met with barriers such as language.
Online auctions efficiency: a survey of ebay auctions
Authors: Wenyan Hu, Alvaro Bolivar
Venue: WWW
Year: 2008

Online auctions have become a pervasive transaction mechanism for e-commerce. As the largest online marketplace in the world, eBay is an attractive case study that enables the study of online auctions utilizing data involving real people and transactions.