OpenRaiser/Intern-Atlas huggingface dataset:
Detection of phishing webpages based on visual similarity
Authors: Wenyin Liu, Guanglin Huang, Xiaoyue Liu, Min Zhang, Xiaotie Deng
Venue: WWW
Year: 2005

An approach to detection of phishing webpages based on visual similarity is proposed, which can be utilized as a part of an enterprise solution for anti-phishing. A legitimate webpage owner can use this approach to search the Web for suspicious webpages which are visually similar to the true webpage. A webpage is reported as a phishing suspect if the visual similarity is higher than its corresponding preset threshold. Preliminary experiments show that the approach can successfully detect those phishing webpages for online use.
Web engineering: technical discipline or social process?
Authors: Bebo White, David B. Lowe, Martin Gaedke, Daniel Schwabe, Yogesh Deshpande
Venue: WWW
Year: 2005

This panel aims to explore the nature of the emerging Web engineering discipline. It will attempt to strongly engage with the issue of whether Web Engineering is currently, and (more saliently) should be in the future, viewed primarily as a technical design discipline with its attention firmly on the way in which Web technologies can be leveraged in the design process, or whether it should be viewed primarily as a socio-positioned discipline which focuses on the nature of the way in which projects are managed, needs are understood and users interact.
Describing namespaces with GRDDL
Authors: Erik Wilde
Venue: WWW
Year: 2005

Describing XML Namespaces is an open issue for many users of XML technologies, and even though namespaces are one of the foundations of XML, there is no generally accepted and widely used format for namespace descriptions. We present a framework for describing namespaces based on GRDDL using a controlled vocabulary. Using this frame-work, namespace descriptions can be easily generated, har-vested and published in human- or machine-readable form.
Can semantic web be made to flourish?
Authors: David Wood, Zavisa Bjelogrlic, Bernadette Hyland, James A. Hendler, Kanzaki Masahide
Venue: WWW
Year: 2005

This panel's objective will be to discuss whether the Semantic Web can be made to grow in a "viral" manner, like the World Wide Web did in the early 1990s. The scope of the discussion will include efforts by the World Wide Web Consortium's Semantic Web Best Practices & Deployment Working Group to identify and publish best practices of Semantic Web practitioners, and the barriers to adoption of those practices by a wider community. The concept of "best practices" as it applies to a distributed, diverse and partially-defined Semantic Web will be discussed and its relevance debated. Specifically, panelists will discuss the capability of standards bodies, commercial companies and early adopters to create a viral technology.
Adaptive query routing in peer web search
Authors: Le-Shin Wu, Ruj Akavipat, Filippo Menczer
Venue: WWW
Year: 2005

An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engines. Here we present novel techniques to improve local adaptive routing, showing they perform significantly better than a simple learning scheme driven by query response interactions among neighbors. We validate prototypes of our peer network application via simulations with 500 model users based on actual Web crawls. We finally compare the quality of the results with those obtained by centralized search engines, suggesting that our application can draw advantages from the context and coverage of the peer collective.
Efficient structural joins with on-the-fly indexing
Authors: Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu
Venue: WWW
Year: 2005

Previous work on structural joins mostly focuses on maintaining offline indexes on disks. Most of them also require the elements in both sets to be sorted. In this paper, we study an on-the-fly, in-memory indexing approach to structural joins. There is no need to sort the elements or maintain indexes on disks. We identify the similarity between the structural join problem and the stabbing query problem, and extend a main memory-based indexing technique for stabbing queries to structural joins.
Identifying link farm spam pages
Authors: Baoning Wu, Brian D. Davison
Venue: WWW
Year: 2005

With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the most important factors in current commercial search engines' ranking systems, new kinds of spam aiming at links have appeared. Building link farms is one technique that can deteriorate link-based ranking algorithms. In this paper, we present algorithms for detecting these link farms automatically by first generating a seed set based on the common link set between incoming and outgoing links of Web pages and then expanding it. Links between identified pages are re-weighted, providing a modified web graph to use in ranking page importance. Experimental results show that we can identify most link farm spam pages and the final ranking results are improved for almost all tested queries.
Retrieving multimedia web objects based on PageRank algorithm
Authors: Christopher C. Yang, K. Y. Chan
Venue: WWW
Year: 2005

Hyperlink analysis has been widely investigated to support the retrieval of Web documents in Internet search engines. It has been proven that the hyperlink analysis significantly improves the relevance of the search results and these techniques have been adopted in many commercial search engines, e.g. Google. However, hyperlink analysis is mostly utilized in the ranking mechanism of Web pages only but not including other multimedia objects, such as images and video. In this project, we propose a modified Multimedia PageRank algorithm to support the searching of multimedia objects in the Web.
Predictive ranking: a novel page ranking approach by estimating the web structure
Authors: Haixuan Yang, Irwin King, Michael R. Lyu
Venue: WWW
Year: 2005

PageRank (PR) is one of the most popular ways to rank web pages. However, as the Web continues to grow in volume, it is becoming more and more difficult to crawl all the available pages. As a result, the page ranks computed by PR are only based on a subset of the whole Web. This produces inaccurate outcome because of the inherent incomplete information (dangling pages) that exist in the calculation. To overcome this incompleteness, we propose a new variant of the PageRank algorithm called, Predictive Ranking (PreR), in which different classes of dangling pages are analyzed individually so that the link structure can be predicted more accurately. We detail our proposed steps. Furthermore, experimental results show that this algorithm achieves encouraging results when compared with previous methods.
An architecture for personal semantic web information retrieval system
Authors: Haibo Yu, Tsunenori Mine, Makoto Amamiya
Venue: WWW
Year: 2005

The semantic Web and Web service technologies have provided both new possibilities and challenges to automatic information processing. There are a lot of researches on applying these new technologies into current personal Web information retrieval systems, but no research addresses the semantic issues from the whole life cycle and architecture point of view. Web services provide a new way for accessing Web resources, but until now, they have been managed separately from traditional Web contents resources. In this poster, we propose a conceptual architecture for a personal semantic Web information retrieval system. It incorporates semantic Web, Web services and multi-agent technologies to enable not only precise location of Web resources but also the automatic or semi-automatic integration of hybrid Web contents and Web services.
A more precise model for web retrieval
Authors: Junli Yuan, Hung Chi, Qibin Sun
Venue: WWW
Year: 2005

Most research works on web retrieval latency are object-level based, which we think is insufficient and sometimes inaccurate. In this paper, we propose a fine grained operation-level Web Retrieval Dependency Model (WRDM) to provide more precise capture of web retrieval process. Our model reveals some new factors in web retrieval which cannot be seen at object level but are very important to studies in the web retrieval area.
X-warehouse: building query pattern-driven data
Authors: Ji Zhang, Wei Wang, Han Liu, Sheng Zhang
Venue: WWW
Year: 2005

In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of integrated XML documents in the warehouse are built using these frequent query patterns represented as Frequent Query Pattern Trees (FreqQPTs). Using hierarchical clustering technique, FreqQPTs are clustered and merged to produce a specified number of integrated XML documents for actual data feeding. Maintenance issue of the data warehouse is also treated in this paper.
An enhanced model for searching in semantic portals
Authors: Lei Zhang, Yong Yu, Jian Zhou, Chenxi Lin, Yin Yang
Venue: WWW
Year: 2005

Semantic Portal is the next generation of web portals that are powered by Semantic Web technologies for improved information sharing and exchange for a community of users. Current methods of searching in Semantic Portals are limited to keyword-based search using information retrieval (IR) techniques, ontology-based formal query and reasoning, or a simple combination of the two. In this paper, we propose an enhanced model that tightly integrates IR with formal query and reasoning to fully utilize both textual and semantic information for searching in Semantic Portals. The model extends the search capabilities of existing methods and can answer more complex search requests. The ideas in a fuzzy description logic (DL) IR model and a formal DL query method are employed and combined in our model. Based on the model, a semantic search service is implemented and evaluated. The evaluation shows very large improvements over existing methods.
XAR-miner: efficient association rules mining for XML data
Authors: Sheng Zhang, Ji Zhang, Han Liu, Wei Wang
Venue: WWW
Year: 2005

In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transform to either an Indexed Content Tree (IX-tree) or Multi-relational databases (Multi-DB), depending on the size of XML document and memory constraint of the system, for efficient data selection and AR mining. Task-relevant concepts are generalized to produce generalized meta-patterns, based on which the large ARs that meet the support and confidence levels are generated.
Service discovery and measurement based on DAML-QoS ontology
Authors: Chen Zhou, Liang-Tien Chia, Bu-Sung Lee
Venue: WWW
Year: 2005

As more and more Web services are deployed, Web service's discovery mechanisms become essential. Similar services can have quite different QoS behaviors. For service selection and management purpose, it is necessary to clearly specify QoS constraints and metrics definitions for Web services. We investigate on the semantic QoS specification and introduce our design principles on it. Based on the specification refinement and conformance, we introduce the QoS matchmaking algorithm with multiple matching degrees. The matchmaking prototype is designed to prove the feasibility. Well-defined Metrics can be further utilized by measurement organizations to monitor and evaluate the promised service level objectives.
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
Authors: Hai Zhuge, Xue Chen, Xiaoping Sun
Venue: WWW
Year: 2005

To improve search efficiency and reduce unnecessary traffic in Peer-to-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential walk (P-Walk). Every peer ranks its neighbors according to searching experience. The highly ranked neighbors have higher probabilities to be queried. Simulation results show that P-Walk is not only efficient, but also robust against malicious behaviors. Furthermore, we measure peers' rank distribution and draw implications.
GIO: a semantic web application using the information grid framework
Authors: Omar Alonso, Sandeepan Banerjee, Mark Drake
Venue: WWW
Year: 2006

It is well understood that the key for successful Semantic Web applications depends on the availability of machine understandable meta-data. We describe the Information Grid, a practical approach to the Semantic Web, and show a prototype implementation. Information grid resources span all the data in the organization and all the metadata required to make it meaningful. The final goal is to let organizations view their assets in a smooth continuum from the Internet to the Intranet, with uniform semantically rich access.
Testing google ionterfaces modified for the blind
Authors: Patrizia Andronico, Marina Buzzi, Barbara Leporini, Carlos Castillo
Venue: WWW
Year: 2006

We present the results of a research project focus on improving the usability of web search tools for blind users who interact via screen reader and voice synthesizer. In the first stage of our study, we proposed eight specific guidelines for simplifying this interaction with search engines. Next, we evaluated these criteria by applying them to Google UIs, re-implementing the simple search and the result page. Finally, we prepared the environment for a remote test with 12 totally blind users. The results highlight how Google interfaces could be improved in order to simplify interaction for the blind.
Supporting online problem-solving communities with the semantic web
Authors: Anupriya Ankolekar, Katia P. Sycara, James D. Herbsleb, Robert E. Kraut, Christopher A. Welty
Venue: WWW
Year: 2006

The Web plays a critical role in hosting Web communities, their content and interactions. A prime example is the open source software (OSS) community, whose members, including software developers and users, interact almost exclusively over the Web, constantly generating, sharing and refining content in the form of software code through active interaction over the Web on code design and bug resolution processes. The Semantic Web is an envisaged extension of the current Web, in which content is given a well defined meaning, through the specification of metadata and ontologies, increasing the utility of the content and enabling information from heterogeneous sources to be integrated. We developed a prototype Semantic Web system for OSS communities, Dhruv. Dhruv provides an enhanced semantic interface to bug resolution messages and recommends related software objects and artifacts. Dhruv uses an integrated model of the OpenACS community, the software, and the Web interactions, which is semi-automatically populated from the existing artifacts of the community.
DoNet: a semantic domotic framework
Authors: Malcolm Attard, Matthew Montebello
Venue: WWW
Year: 2006

With the giant steps in technology and the massive strides in hardware, software and communication it is not in the very distant future that complete households will be entirely networked as a de facto standard. In this work we examine current research trends and illustrate our work in the area of domotics where personalization, semantics and agent technology come together. We look at the different aspects of identification, interconnectivity, virtual representation, user interfaces and context, and develop a home system oriented ontology in OWL. This ontology provides the ability to describe events, states, information, agents, items, locations, operational ECA rules, user preferences and their relations. We also propose an agent based framework and abstraction and reasoning mechanisms to permit modular and rapid development of home control and automation components. A web based interface provides suggestions, information and ontology access, while a puzzle based graphical user interface, provides simplified rule construction capabilities. The ever changing nature of the home, places the user in a position where he needs to be involved and become, through DoNet, a part of an ongoing home system optimization process.
Knowing the user's every move: user activity tracking for website usability evaluation and implicit interaction
Authors: Richard Atterer, Monika Wnuk, Albrecht Schmidt
Venue: WWW
Year: 2006

In this paper, we investigate how detailed tracking of user interaction can be monitored using standard web technologies. Our motivation is to enable implicit interaction and to ease usability evaluation of web applications outside the lab. To obtain meaningful statements on how users interact with a web application, the collected information needs to be more detailed and fine-grained than that provided by classical log files. We focus on tasks such as classifying the user with regard to computer usage proficiency or making a detailed assessment of how long it took users to fill in fields of a form. Additionally, it is important in the context of our work that usage tracking should not alter the user's experience and that it should work with existing server and browser setups. We present an implementation for detailed tracking of user actions on web pages. An HTTP proxy modifies HTML pages by adding JavaScript code before delivering them to the client. This JavaScript tracking code collects data about mouse movements, keyboard input and more. We demonstrate the usefulness of our approach in a case study.
Selective hypertext induced topic search
Authors: Amit C. Awekar, Pabitra Mitra, Jaewoo Kang
Venue: WWW
Year: 2006

We address the problem of answering broad-topic queries on the World Wide Web. We present a link based analysis algorithm SelHITS, which is an improvement over Kleinberg's HITS [2] algorithm. We introduce the concept of virtual links to exploit the latent information in the hyperlinked environment. We propose a novel approach to calculate hub and authority values. We also present a selective expansion method which avoids topic drift and provides results consistent with only one interpretation of the query, even if the query is ambiguous. Initial experimental evaluation and user feedback show that our algorithm indeed distills the most important and relevant pages for broad-topic queries. We also infer that there exists a uniform notion of quality of search results within users.
Design and development of learning management system at universiti Putra Malaysia: a case study of e-SPRINT
Authors: Sidek H. A. Aziz, Aida Suraya M. Yunus, Kamariah A. Bakar, Hamidah B. Meseran
Venue: WWW
Year: 2006

This paper reports the design and development of the e-SPRINT, Learning Management System, which has been derived from Sistem Pengurusan Rangkaian Integrasi Notakuliah dalam Talian - mod Elektronik) and currently being implemented at Universiti Putra Malaysia (UPM). The e-SPRINT was developed by utilizing PERL (Practical Extraction and Report Language) and was supported by standard database in Linux/UNIX environment operating system. The system is currently being used to supplement and complement part of the classroom-based teaching. This paper covers the architecture and features of the e-SPRINT system which consists of five main modules. Some general issues and challenges of such e-learning initiatives implementation will also be discussed.
Generating maps of web pages using cellular automata
Authors: Hanene Azzag, David Ratsimba, David Da Costa, Gilles Venturini, Christiane Guinot
Venue: WWW
Year: 2006

The aim of web pages visualization is to present in a very informative and interactive way a set of web documents to the user in order to let him or her navigate through these documents. In the web context, this may correspond to several user's tasks: displaying the results of a search engine, or visualizing a graph of pages such as a hypertext or a surf map. In addition to web pages visualization, web pages clustering also greatly improves the amount of information presented to the user by highlighting the similarities between the documents [6]. In this paper we explore the use of a cellular automata (CA) to generate such maps of web pages.
Relationship between web links and trade
Authors: Ricardo A. Baeza-Yates, Carlos Castillo
Venue: WWW
Year: 2006

We report on observations on Web characterization studies that suggest that the amount of Web links among sites under different country-code top-level domains is related to the amount of trade between the corresponding countries.
Finding experts and their eetails in e-mail corpora
Authors: Krisztian Balog, Maarten de Rijke
Venue: WWW
Year: 2006

We present methods for finding experts (and their contact details) using e-mail messages. We locate messages on a topic, and then find the associated experts. Our approach is unsupervised: both the list of potential experts and their personal details are obtained automatically from e-mail message headers and signatures, respectively. Evaluation is done using the e-mail lists in the W3C corpus.
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Authors: Shumeet Baluja
Venue: WWW
Year: 2006

Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full web page and allow the user to simply press a single key to zoom into a region (which may then be transcoded into wml/xhtml, summarized, etc). However, if regions for zooming are presented naively, this yields a frustrating experience because of the number of coherent regions, sentences, images, and words that may be inadvertently separated. Here, we cast the web page segmentation problem into a machine learning framework, where we re-examine this task through the lens of entropy reduction and decision tree learning. This yields an efficient and effective page segmentation algorithm. We demonstrate how simple techniques from computer vision can be used to fine-tune the results. The resulting segmentation keeps coherent regions together when tested on a broad set of complex webpages.
Random sampling from a search engine's index
Authors: Ziv Bar-Yossef, Maxim Gurevich
Venue: WWW
Year: 2006

We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from a search engine's index using only the search engine's public interface? Such a primitive is particularly useful in creating objective benchmarks for search engines.The technique of Bharat and Broder suffers from two well recorded biases: it favors long documents and highly ranked documents. In this paper we introduce two novel sampling techniques: a lexicon-based technique and a random walk technique. Our methods produce biased sample documents, but each sample is accompanied by a corresponding "weight", which represents the probability of this document to be selected in the sample. The samples, in conjunction with the weights, are then used to simulate near-uniform samples. To this end, we resort to three well known Monte Carlo simulation methods: rejection sampling, importance sampling and the Metropolis-Hastings algorithm.We analyze our methods rigorously and prove that under plausible assumptions, our techniques are guaranteed to produce near-uniform samples from the search engine's index. Experiments on a corpus of 2.4 million documents substantiate our analytical findings and show that our algorithms do not have significant bias towards long or highly ranked documents. We use our algorithms to collect fresh data about the relative sizes of Google, MSN Search, and Yahoo!.