OpenRaiser/Intern-Atlas huggingface dataset:
Querying the past, present and future: where we are and where we will be
Authors: Ling Liu, Andrei Z. Broder, Dieter Fensel, Carole A. Goble, Calton Pu
Venue: WWW
Year: 2005

This panel will focus on exploring future enhancements of Web technology for active Internet-scale information delivery and dissemination. It will ask the questions of whether the current Web technology is sufficient, what can be leveraged in this endeavor, and how a combination of ideas from a variety of existing disciplines can help in meeting the new challenges of large scale information dissemination. Relevant existing technologies and research areas include: active databases, agent systems, continual queries, event Web, publish/subscribe technology, sensor and stream data management. We expect that some suggestions may be in conflict with current, well-accepted approaches.
Site abstraction for rare category classification in large-scale web directory
Authors: Tie-Yan Liu, Hao Wan, Tao Qin, Zheng Chen, Yong Ren, Wei-Ying Ma
Venue: WWW
Year: 2005

Automatically classifying the Web directories is an effective way to manage Web information. However, our experiments showed that the state-of-the-art text classification technologies could not lead to acceptable performance in this task. Due to our analysis, the main problem is the lack of effective training data in rare categories of Web directories. To tackle this problem, we proposed a novel technology named Site Abstraction to synthesize new training examples from the website of the existing training document. The main idea is to propagate features through parent-child relationship in the sitemap tree. Experiments showed that our method significantly improved the classification performance.
Web data cleansing for information retrieval using key resource page selection
Authors: Yiqun Liu, Canhui Wang, Min Zhang, Shaoping Ma
Venue: WWW
Year: 2005

With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web page non-content feature analysis, we proposed a clustering-based method to select high quality pages from the whole page set. Although the result page set contains only 44.3% of the whole collection, it is related with more than 98% of links and covers about 90% of key information. Link property and retrieval affects are also observed and experiment results show that key resource selection method is more suitable for the job of data cleansing and the result page set outperforms the whole collection by smaller size and better retrieval performance.
Mining web site's topic hierarchy
Authors: Nan Liu, Christopher C. Yang
Venue: WWW
Year: 2005

Searching and navigating a Web site is a tedious task and the hierarchical models, such as site maps, are frequently used for organizing the Web site's content. In this work, we propose to model a Web site's content structure using the topic hierarchy, a directed tree rooted at a Web site's homepage in which the vertices and edges correspond to Web pages and hyperlinks. Our algorithm for mining a Web site's topic hierarchy utilizes three types of information associated with a Web site: link structure, directory structure and Web pages' content.
An experimental study on large-scale web categorization
Authors: Tie-Yan Liu, Yiming Yang, Hao Wan, Qian Zhou, Bin Gao, Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma
Venue: WWW
Year: 2005

Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification technologies can perform well on and scale up to such large-scale applications. To understand this, we conducted the evaluation of several representative methods (Support Vector Machines, k-Nearest Neighbor and Naive Bayes) with Yahoo! taxonomies. In particular, we evaluated the effectiveness/efficiency tradeoff in classifiers with hierarchical setting compared to conventional (flat) setting, and tested popular threshold tuning strategies for their scalability and accuracy in large-scale classification problems.
A semantic-link-based infrastructure for web service discovery in P2P networks
Authors: Jie Liu, Hai Zhuge
Venue: WWW
Year: 2005

An important issue arising from P2P applications is how to accurately and efficiently retrieve the required Web services from large-scale repositories. This paper resolves this issue by organizing services in the overlay combining the Semantic Service Link Network and the Chord P2P network. A service request will first be routed in the Chord according to the given service operation names and keywords. Then, the same request will be routed in the Semantic Link Network according to the service link type and semantic matching. Compared with previous P2P service discovery approaches, the proposed approach has two advantages: (1) produce more accurate and meaning results when searching for particular services in a P2P network; and (2) enable users and peers to discover services in a more flexible way.
Improved timing control for web server systems using internal state information
Authors: Xue Liu, Rong Zheng, Jin Heo, Lui Sha
Venue: WWW
Year: 2005

How to effectively allocate system resource to meet the Service Level Agreement (SLA) of Web servers is a challenging problem. In this paper, we propose an improved scheme for autonomous timing performance control in Web servers under highly dynamic traffic loads. We devise a novel delay regulation technique called Queue Length Model Based Feedback Control utilizing server internal state information to reduce response time variance in presence of bursty traffic. Both simulation and experimental studies using synthesized workloads and real-world Web traces demonstrate the effectiveness of the proposed approach.
Three-level caching for efficient query processing in large Web search engines
Authors: Xiaohui Long, Torsten Suel
Venue: WWW
Year: 2005

Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple terabytes, a single query may require the processing of hundreds of megabytes or more of index data. To keep up with this immense workload, large search engines employ clusters of hundreds or thousands of machines, and a number of techniques such as caching, index compression, and index and query pruning are used to improve scalability. In particular, two-level caching techniques cache results of repeated identical queries at the frontend, while index data for frequently used query terms are cached in each node at a lower level.We propose and evaluate a three-level caching scheme that adds an intermediate level of caching for additional performance gains. This intermediate level attempts to exploit frequently occurring pairs of terms by caching intersections or projections of the corresponding inverted lists. We propose and study several offline and online algorithms for the resulting weighted caching problem, which turns out to be surprisingly rich in structure. Our experimental evaluation based on a large web crawl and real search engine query log shows significant performance gains for the best schemes, both in isolation and in combination with the other caching levels. We also observe that a careful selection of cache admission and eviction policies is crucial for best overall performance.
Applying NavOptim to minimise navigational effort
Authors: David B. Lowe, Xiaoying Kong
Venue: WWW
Year: 2005

A major factor in the effectiveness of the interaction which users have with Web applications is the ease with which they can locate information and functionality which they are seeking. Effective design is however complicated by the multiple design purposes and diverse users which Web applications typically support. In this paper we describe a navigational design method aimed at optimising designs through minimizing navigational entropy. The approach uses a theoretical navigational depth for the various information and service components to moderate a nested hierarchical clustering of the content.
TJFast: effective processing of XML twig pattern matching
Authors: Jiaheng Lu, Ting Chen, Tok Wang Ling
Venue: WWW
Year: 2005

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process a twig query based on region encoding. In this paper, based on a novel labeling scheme: extended Dewey, we propose a novel and efficient holistic twig join algorithm, namely TJFast. Compared to previous work, our algorithm only needs to access the labels of leaf query nodes. We report our experimental results to show that our algorithms are superior to previous approaches in terms of the number of elements scanned and query performance.
Soundness proof of Z semantics of OWL using institutions
Authors: Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
Venue: WWW
Year: 2005

The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logical systems, we use institutions to represent their underlying logical systems and use institution morphisms to prove the correctness of the Z semantics for OWL DL.
Mining directed social network from message board
Authors: Naohiro Matsumura, David E. Goldberg, Xavier Llorà
Venue: WWW
Year: 2005

In the paper, we present an approach to mining a directed social network from a message board on the Internet where vertices denote individuals and directed links denote the flow of influence. The influence is measured based on propagating terms among individuals via messages. The distance with respect to contextual similarity between individuals is acquired since the influence indicates the degree of their shared interest represented as terms.
Extracting semantic structure of web documents using content and visual information
Authors: Rupesh R. Mehta, Pabitra Mitra, Harish Karnick
Venue: WWW
Year: 2005

This work aims to provide a page segmentation algorithm which uses both visual and content information to extract the semantic structure of a web page. The visual information is utilized using the VIPS algorithm and the content information using a pre-trained Naive Bayes classifier. The output of the algorithm is a semantic structure tree whose leaves represent segments having unique topic. However contents of the leaf segments may possibly be physically distributed in the web page. This structure can be useful in many web applications like information retrieval, information extraction and automatic web page adaptation. This algorithm is expected to outperform other existing page segmentation algorithms since it utilizes both content and visual information.
On the lack of typical behavior in the global Web traffic network
Authors: Mark R. Meiss, Filippo Menczer, Alessandro Vespignani
Venue: WWW
Year: 2005

We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver host graph containing more than 18 &amp;times 10^6 vertices and 68 &amp;times 10^6 edges valued by relative traffic flows. When considered as a traffic map of the World-Wide Web, the generated graph provides valuable information on the statistical patterns that characterize the global information flow on the Web. Statistical analysis shows that client-server connections and traffic flows exhibit heavy-tailed probability distributions lacking any typical scale. In particular, the absence of an intrinsic average in some of the distributions implies the absence of a prototypical scale appropriate for server design, Web-centric network design, or traffic modeling. The inspection of the amount of traffic handled by clients and servers and their number of connections highlights non-trivial correlations between information flow and patterns of connectivity as well as the presence of anomalous statistical patterns related to the behavior of users on the Web. The results presented here may impact considerably the modeling, scalability analysis, and behavioral study of Web applications.
Duplicate detection in click streams
Authors: Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
Venue: WWW
Year: 2005

We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solution based on Bloom Filters [9], and discuss the space and time requirements for running the proposed algorithm in both the contexts of sliding, and landmark stream windows. We run a comprehensive set of experiments, using both real and synthetic click streams, to evaluate the performance of the proposed solution. The results demonstrate that the proposed solution yields extremely low error rates.
The language observatory project (LOP)
Authors: Yoshiki Mikami, Pavol Zavarsky, Mohd Zaidi Abd Rozan, Izumi Suzuki, Masayuki Takahashi, Tomohide Maki, Irwan Nizan Ayob, Paolo Boldi, Massimo Santini, Sebastiano Vigna
Venue: WWW
Year: 2005

The first part of the paper provides a brief description of the Language Observatory Project (LOP) and highlights the major technical difficulties to be challenged. The latter part gives how we responded to these difficulties by adopting UbiCrawler as a data collecting engine for the project. An interactive collaboration between the two groups is producing quite satisfactory results.
Static approximation of dynamically generated Web pages
Authors: Yasuhiko Minamide
Venue: WWW
Year: 2005

Server-side programming is one of the key technologies that support today's WWW environment. It makes it possible to generate Web pages dynamically according to a user's request and to customize pages for each user. However, the flexibility obtained by server-side programming makes it much harder to guarantee validity and security of dynamically generated pages.To check statically the properties of Web pages generated dynamically by a server-side program, we develop a static program analysis that approximates the string output of a program with a context-free grammar. The approximation obtained by the analyzer can be used to check various properties of a server-side program and the pages it generates.To demonstrate the effectiveness of the analysis, we have implemented a string analyzer for the server-side scripting language PHP. The analyzer is successfully applied to publicly available PHP programs to detect cross-site scripting vulnerabilities and to validate pages they generate dynamically.
Personal TV viewing by using live chat as metadata
Authors: Hisashi Miyamori, Satoshi Nakamura, Katsumi Tanaka
Venue: WWW
Year: 2005

We propose a new TV viewing method by personalizing TV programs with live chat information on the Web. It enables a new way of viewing TV content from different perspectives reflecting viewers' viewpoints.
Webified video: media conversion from TV program to web content and their integrated viewing method
Authors: Hisashi Miyamori, Katsumi Tanaka
Venue: WWW
Year: 2005

A method is proposed for viewing broadcast content that converts TV programs into Web content and integrates the results with related information retrieved using local and/or Internet content.
Browsing fatigue in handhelds: semantic bookmarking spells relief
Authors: Saikat Mukherjee, I. V. Ramakrishnan
Venue: WWW
Year: 2005

Focused Web browsing activities such as periodically looking up headline news, weather reports, etc., which require only selective fragments of particular Web pages, can be made more efficient for users of limited-display-size handheld mobile devices by delivering only the target fragments. Semantic bookmarks provide a robust conceptual framework for recording and retrieving such targeted content not only from the specific pages used in creating the bookmarks but also from any user-specified page with similar content semantics. This paper describes a technique for realizing semantic bookmarks by coupling machine learning with Web page segmentation to create a statistical model of the bookmarked content. These models are used to identify and retrieve the bookmarked content from Web pages that share a common content domain. In contrast to ontology-based approaches where semantic bookmarks are limited to available concepts in the ontology, the learning-based approach allows users to bookmark ad-hoc personalized semantic concepts to effectively target content that fits the limited display of handhelds. User evaluation measuring the effectiveness of a prototype implementation of learning-based semantic bookmarking at reducing browsing fatigue in handhelds is provided.
One project, four schema languages: medley or melee?
Authors: Makoto Murata
Venue: WWW
Year: 2005

This talk first gives an overview of an XML project for e-Local Governments, which is under the auspices of MIAC (Ministry of Internal Affairs and Communications) of Japan. This talk then focuses on schema authoring and user interfaces. In particular, the use of four schema languages, namely RELAX NG, W3C XML Schema, DTD, and Schematron, is highlighted.
Web2Talkshow: transforming web content into TV-program-like content based on the creation of dialogue
Authors: Akiyo Nadamoto, Masaki Hayashi, Katsumi Tanaka
Venue: WWW
Year: 2005

We propose a new browsing system called "Web2Talkshow". It transforms declarative-based web content into humorous dialog-based TV-program-like content that is presented through cartoon animation and synthesized speech. The system does this based on keywords in the original web content. Web2Talkshow enable users to get desired web content easily, pleasantly, and in a user-friendly way while being able to continue working on other tasks. Thus, using it will be much like watching TV.
Accuracy enhancement of function-oriented web image classification
Authors: Koji Nakahira, Toshihiko Yamasaki, Kiyoharu Aizawa
Venue: WWW
Year: 2005

We propose a function-oriented classification of web images and show new applications using this categorization. We defined nine categories of images taking into account of their functions used in web pages, and classified web images by using Support Vector Machine (SVM) in tree structured way. In order to achieve high accuracy of classification, we employed two kinds of features, image-based features and text-based features, and the two kinds can be used together or separately for the stages of the classification. We also utilized DCT coefficients to classify photo images and illustrations. As a result, accurate classification has been achieved. Finally, we show the page summarization as a new application that is made feasible for the first time by our new categories of WWW images.
An agent system for ontology sharing on WWW
Authors: Kotaro Nakayama, Takahiro Hara, Shojiro Nishio
Venue: WWW
Year: 2005

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.
Object-level ranking: bringing order to Web objects
Authors: Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying Ma
Venue: WWW
Year: 2005

In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level. We collect Web information for objects relevant for a specific application domain and rank these objects in terms of their relevance and popularity to answer user queries. Traditional PageRank model is no longer valid for object popularity calculation because of the existence of heterogeneous relationships between objects. This paper introduces PopRank, a domain-independent object-level link analysis model to rank the objects within a specific domain. Specifically we assign a popularity propagation factor to each type of object relationship, study how different popularity propagation factors for these heterogeneous relationships could affect the popularity ranking, and propose efficient approaches to automatically decide these factors. Our experiments are done using 1 million CS papers, and the experimental results show that PopRank can achieve significantly better ranking results than naively applying PageRank on the object graph.
Automated semantic web services orchestration via concept covering
Authors: Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone, Simona Colucci
Venue: WWW
Year: 2005

We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorithm for semantic based automated Web service orchestration, fully compliant with Semantic Web technologies. We show the proposed approach is able to deal with not exact solutions, computing an approximate orchestration with respect to an agent request modeled a subset of OWL-DL.
Incremental maintenance for materialized XPath/XSLT views
Authors: Makoto Onizuka, Fong Yee Chan, Ryusuke Michigami, Takashi Honishi
Venue: WWW
Year: 2005

This paper proposes an incremental maintenance algorithm that e#ciently updates the materialized XPath/XSLT views defined using XPath expressions in XP{[],*,//,vars}. The algorithm consists of two processes. 1) The dynamic execution flow of an XSLT program is stored as an XT (XML Transformation) tree during the full transformation. 2) In response to a source XML data update, the impacted portions of the XT-tree are identified and maintained by partially re-evaluating the XSLT program. This paper discusses the XPath/XSLT features of incremental view maintenance for subtree insertion/deletion and applies them to the maintenance algorithm. Experiments show that the incremental maintenance algorithm outperforms full XML transformation algorithms by factors of up to 500.
Semantic virtual environments
Authors: Karsten A. Otto
Venue: WWW
Year: 2005

Today's Virtual Environment (VE) systems share a number of issues with the HTML-based World Wide Web. Their content is usually designed for presentation to humans, and thus is not suitable for machine access. This is complicated by the large number of different data models and network protocols in use. Accordingly, it is difficult to develop VE software, such as agents, services, and tools.In this paper we adopt the Semantic Web idea to the field of virtual environments. Using the Resource Description Framework (RDF) we establish a machine-understandable abstraction of existing VE systems --- the Semantic Virtual Environments (SVE). On this basis it is possible to develop system-independent software, which could even operate across VE system boundaries.
Web log mining with adaptive support thresholds
Authors: Jian Chih Ou, Chang-Hung Lee, Ming-Syan Chen
Venue: WWW
Year: 2005

With the fast increase in Web activities, Web data mining has recently become an important research topic. However, most previous studies of mining path traversal patterns are based on the model of a uniform support threshold without taking into consideration such important factors as the length of a pattern, the positions of Web pages, and the importance of a particular pattern, etc. In view of this, we study and apply the Markov chain model to provide the determination of support threshold of Web documents. Furthermore, by properly employing some techniques devised for joining reference sequences, a new mining procedure of Web traversal patterns is proposed in this paper.