Open Access. Powered by Scholars. Published by Universities.®

Numerical Analysis and Scientific Computing Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 871 - 900 of 1060

Full-Text Articles in Numerical Analysis and Scientific Computing

Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu Oct 2007

Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu

Research Collection School Of Computing and Information Systems

We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "break-down-and-build-up" methodology. The "breakdown" is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call strands. We developed efficient algorithms to quickly mine out all strands by iterative growth. In the "build-up" stage, these strands are grouped up to form the support sets from which all approximate patterns would be identified. A salient feature of our algorithm is its ability to grow the frequent patterns by iteratively …

Go to article

A Genetic Algorithm For Cellular Manufacturing Design And Layout, Xiaodan Wu, Chao-Hsien Chu, Yunfeng Wang, Weili Yan Aug 2007

A Genetic Algorithm For Cellular Manufacturing Design And Layout, Xiaodan Wu, Chao-Hsien Chu, Yunfeng Wang, Weili Yan

Research Collection School Of Computing and Information Systems

Cellular manufacturing (CM) is an approach that can be used to enhance both flexibility and efficiency in today’s small-to-medium lot production environment. The design of a CM system (CMS) often involves three major decisions: cell formation, group layout, and group schedule. Ideally, these decisions should be addressed simultaneously in order to obtain the best results. However, due to the complexity and NP-complete nature of each decision and the limitations of traditional approaches, most researchers have only addressed these decisions sequentially or independently. In this study, a hierarchical genetic algorithm is developed to simultaneously form manufacturing cells and determine the group …

Go to article

Theoretical And Practical Complexity Of Modeling Methods, John Erickson, Keng Siau Aug 2007

Theoretical And Practical Complexity Of Modeling Methods, John Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

The estimation of theoretical and practical complexity of a system development method is discussed. Executable model capability allow developers to transform models developed during the Systems Analysis and Design portion of the systems development process into working applications. Systems are becoming more complex mostly because of influencing factors such as required and enhanced functionality, interoperability, and security. Other trends that impact the complexity of applications include systems such as enterprise resource planning, supply chain management, and customer relationship management. These types of systems are very large and complex and require close internal cooperation for the implementing organizations individually and also …

Go to article

On Searching Continuous Nearest Neighbors In Wireless Data Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee Jul 2007

On Searching Continuous Nearest Neighbors In Wireless Data Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee

Research Collection School Of Computing and Information Systems

A continuous nearest neighbor (CNN) search, which retrieves the nearest neighbors corresponding to every point in a given query line segment, is important for location-based services such as vehicular navigation and tourist guides. It is infeasible to answer a CNN search by issuing a traditional nearest neighbor query at every point of the line segment due to the large number of queries generated and the overhead on bandwidth. Algorithms have been proposed recently to support CNN search in the traditional client-server systems but not in the environment of wireless data broadcast, where uplink communication channels from mobile devices to the …

Go to article

Discovering And Exploiting Causal Dependencies For Robust Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang Jul 2007

Discovering And Exploiting Causal Dependencies For Robust Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Acquisition of context poses unique challenges to mobile context-aware recommender systems. The limited resources in these systems make minimizing their context acquisition a practical need, and the uncertainty in the mobile environment makes missing and erroneous context inputs a major concern. In this paper, we propose an approach based on Bayesian networks (BNs) for building recommender systems that minimize context acquisition. Our learning approach iteratively trims the BN-based context model until it contains only the minimal set of context parameters that are important to a user. In addition, we show that a two-tiered context model can effectively capture the causal …

Go to article

Learning Causal Models For Noisy Biological Data Mining: An Application To Ovarian Cancer Detection, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang Jul 2007

Learning Causal Models For Noisy Biological Data Mining: An Application To Ovarian Cancer Detection, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Undetected errors in the expression measurements from highthroughput DNA microarrays and protein spectroscopy could seriously affect the diagnostic reliability in disease detection. In addition to a high resilience against such errors, diagnostic models need to be more comprehensible so that a deeper understanding of the causal interactions among biological entities like genes and proteins may be possible. In this paper, we introduce a robust knowledge discovery approach that addresses these challenges. First, the causal interactions among the genes and proteins in the noisy expression data are discovered automatically through Bayesian network learning. Then, the diagnosis of a disease based on …

Go to article

Continuous Monitoring Of Top-K Queries Over Sliding Windows, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias Jul 2007

Continuous Monitoring Of Top-K Queries Over Sliding Windows, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in conventional databases, the existing methods are inapplicable to highly dynamic environments involving numerous long-running queries. This paper studies continuous monitoring of top-k queries over a fixed-size window W of the most recent data. The window size can be expressed either in terms of the number of active tuples or time units. We propose a general methodology for top-k monitoring that restricts processing to the sub-domains of the workspace …

Go to article

Continuous Medoid Queries Over Moving Objects, Stavros Papadopoulos, Dimitris Sacharidis, Kyriakos Mouratidis Jul 2007

Continuous Medoid Queries Over Moving Objects, Stavros Papadopoulos, Dimitris Sacharidis, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

In the k-medoid problem, given a dataset P, we are asked to choose kpoints in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points in P and their closest medoid. Finding the optimal k medoids is NP hard, and existing algorithms aim at approximate answers, i.e., they compute medoids that achieve a small, yet not minimal, average distance. Similarly in this paper, we also aim at approximate solutions. We consider, however, the continuous version of the problem, where the points in P move and our task is to maintain the medoid set on-the-fly …

Go to article

Analyzing Feature Trajectories For Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim Jul 2007

Analyzing Feature Trajectories For Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

We consider the problem of analyzing word trajectories in both time and frequency domains, with the specific goal of identifying important and less-reported, periodic and aperiodic words. A set of words with identical trends can be grouped together to reconstruct an event in a completely un-supervised manner. The document frequency of each word across time is treated like a time series, where each element is the document frequency - inverse document frequency (DFIDF) score at one time point. In this paper, we 1) first applied spectral analysis to categorize features for different event characteristics: important and less-reported, periodic and aperiodic; …

Go to article

Usage-Based Versus Flat Pricing For E-Business Services With Differentiated Qos, Zhen Liu, Laura Wynter, Cathy Xia Jun 2007

Usage-Based Versus Flat Pricing For E-Business Services With Differentiated Qos, Zhen Liu, Laura Wynter, Cathy Xia

Research Collection School Of Computing and Information Systems

Design of e-commerce services that are competitive, in such a quickly responding market, requires the analyses of prices and price structures. We present a general model of an e-commerce market that allows us to analyze optimal price structures, both flat and usage-based. Based on the price structure of a major web hosting provider, we consider both single-tier and two-tier (burst-rate) pricing, and our result suggests that the more complex two-tier structure may not be worth the marketing effort, as the firm?s equilibrium profits will not increase through the use of this structure. An essential feature of our approach is that …

Go to article

Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias Jun 2007

Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road networks, where the distance between a query and a data object is determined by the length of the shortest path connecting them. We propose two methods that can handle arbitrary object and query moving patterns, as well as fluctuations of edge weights. The first one maintains the query results by processing only updates that may invalidate …

Go to article

Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai Jun 2007

Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

Domain adaptation is an important problem in natural language processing (NLP) due to the lack of labeled data in novel domains. In this paper, we study the domain adaptation problem from the instance weighting per- spective. We formally analyze and charac- terize the domain adaptation problem from a distributional view, and show that there are two distinct needs for adaptation, cor- responding to the different distributions of instances and classification functions in the source and the target domains. We then propose a general instance weighting frame- work for domain adaptation. Our empir- ical results on three NLP tasks show that …

Go to article

Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo Jun 2007

Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo

Research Collection School Of Computing and Information Systems

Integrated with G-Portal, a Web-based geospatial digital library of geography resources, this paper describes the implementation of Mobile G-Portal, a group of mobile devices as learning assistant tools supporting collaborative sharing and learning for geography fieldwork. Based on a modified Technology Acceptance Model and a Task-Technology Fit model, an initial study with Mobile G-Portal was conducted involving 39 students in a local secondary school. The findings suggested positive indication of acceptance of Mobile G-Portal for geography fieldwork. The paper concludes with a discussion on technological challenges, recommendations for refinement of Mobile G-Portal, and design implications in general for digital libraries …

Go to article

Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu May 2007

Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu

Research Collection School Of Computing and Information Systems

In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset constraints, structural constraints, such as density and diameter of a graph, are very hard to be pushed deep into the mining process. In this paper, we give the first comprehensive study on the pruning properties of both traditional and structural constraints aiming to reduce not only the pattern search space but the data search space as well. A new general framework, called gPrune, is proposed to incorporate all the constraints in such a way that they …

Go to article

Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong May 2007

Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong

Research Collection School Of Computing and Information Systems

Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network …

Go to article

Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng Apr 2007

Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng

Research Collection School Of Computing and Information Systems

Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the existing frequent-pattern mining algorithms encounter challenges at mining rather large patterns, called colossal frequent patterns, in the presence of an explosive number of frequent patterns. Colossal patterns are critical to many applications, especially in domains like bioinformatics. In this study, we investigate a novel mining approach called Pattern-Fusion to efficiently find a good approximation to the colossal patterns. With Pattern-Fusion, a colossal pattern is discovered by fusing its small core patterns in one step, …

Go to article

Summarizing Review Scores Of "Unequal" Reviewers, Hady W. Lauw, Ee Peng Lim, Ke Wang Apr 2007

Summarizing Review Scores Of "Unequal" Reviewers, Hady W. Lauw, Ee Peng Lim, Ke Wang

Research Collection School Of Computing and Information Systems

A frequently encountered problem in decision making is the following review problem: review a large number of objects and select a small number of the best ones. An example is selecting conference papers from a large number of submissions. This problem involves two sub-problems: assigning reviewers to each object, and summarizing reviewers ’ scores into an overall score that supposedly reflects the quality of an object. In this paper, we address the score summarization sub-problem for the scenario where a small number of reviewers evaluate each object. Simply averaging the scores may not work as even a single reviewer could …

Go to article

Tube (Text-Cube) For Discovering Documentary Evidence Of Associations Among Entities, Hady Lauw, Ee Peng Lim, Hwee Hwa Pang Mar 2007

Tube (Text-Cube) For Discovering Documentary Evidence Of Associations Among Entities, Hady Lauw, Ee Peng Lim, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

User-driven discovery of associations among entities, and documents that provide evidence for these associations, is an important search task conducted by researchers and do-main information specialists. Entities here refer to real or abstract objects such as people, organizations, ideologies, etc. Associations are the inter-relationships among entities. Most current works in query-driven document retrieval and finding representative subgraphs are ill-suited for the task as they lack an awareness of entity types as well as an intuitive representation of associations. We propose the TUBE model, a text cube approach for discovering associations and documentary evidence of these associations. The model consists of …

Go to article

Searching And Tagging: Two Sides Of The Same Coin?, Qiaozhu Mei, Jing Jiang, Hang Su, Chengxiang Zhai Jan 2007

Searching And Tagging: Two Sides Of The Same Coin?, Qiaozhu Mei, Jing Jiang, Hang Su, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

This paper presents the duality hypothesis of search and tagging, two important behaviors of web users. The hypothesis states that if a user views a document D in the search results for query Q, the user would tend to assign document $D$ a tag identical to or similar to Q; similarly, if a user tags a document D with a tag T, the user would tend to view document D if it is in the search results obtained using T as a query. We formalize this hypothesis with a unified probabilistic model for search and tagging, and show that empirical …

Go to article

Anticipatory Event Detection Via Classification, He Qi, Kuiyu Chang, Ee Peng Lim Jan 2007

Anticipatory Event Detection Via Classification, He Qi, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The idea of event detection is to identify interesting patterns from a constant stream of incoming news documents. Previous research in event detection has largely focused on identifying the first event or tracking subsequent events belonging to a set of pre-assigned topics such as earthquakes, airline disasters, etc. In this paper, we describe a new problem, called anticipatory event detection (AED), which aims to detect if a user-specified event has transpired. AED can be viewed as a personalized combination of event tracking and new event detection. We propose using sentence-level and document-level classification approaches to solve the AED problem for …

Go to article

A Growth Theory Perspective On The International Diffusion Of Electronic Commerce., S.C Ho, Robert John Kauffman, T.P. Liang Jan 2007

A Growth Theory Perspective On The International Diffusion Of Electronic Commerce., S.C Ho, Robert John Kauffman, T.P. Liang

Research Collection School Of Computing and Information Systems

Information and communication technologies (ICTs) continue to have a profound effect on the economies and societies where they are used. In this article, we propose three related theories to describe the underlying mechanism for growth in e-commerce revenues at the national level. Endogenous growth theory posits that the primary drivers of e-commerce growth are internal to a country. Exogenous growth theory suggests that the primary drivers of e-commerce growth are external to an economic system, and reflect the forces of the regional economy. A blend of these, a mixed endogenous–exogenous growth theory, incorporates drivers from both the economy and …

Go to article

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen Dec 2006

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Computing and Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …

Go to article

Measuring Qualities Of Articles Contributed By Online Communities, Ee Peng Lim, Ba-Quy Vuong, Hady W. Lauw, Aixin Sun Dec 2006

Measuring Qualities Of Articles Contributed By Online Communities, Ee Peng Lim, Ba-Quy Vuong, Hady W. Lauw, Aixin Sun

Research Collection School Of Computing and Information Systems

Using open source Web editing software (e.g., wiki), online community users can now easily edit, review and publish articles collaboratively. While much useful knowledge can be derived from these articles, content users and critics are often concerned about their qualities. In this paper, we develop two models, namely basic model and peer review model, for measuring the qualities of these articles and the authorities of their contributors. We represent collaboratively edited articles and their contributors in a bipartite graph. While the basic model measures an article's quality using both the authorities of contributors and the amount of contribution from each …

Go to article

Query-Based Watermarking For Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan Dec 2006

Query-Based Watermarking For Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

As increasing amount of XML data is exchanged over the internet, copyright protection of this type of data is becoming an important requirement for many applications. In this paper, we introduce a rights protection scheme for XML data based on digital watermarking. One of the main challenges for watermarking XML data is that the data could be easily reorganized by an adversary in an attempt to destroy any embedded watermark. To overcome it, we propose a query-based watermarking scheme, which creates queries to identify available watermarking capacity, such that watermarks could be recovered from reorganized data through query rewriting. The …

Go to article

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Composition, Jialie Shen, John Shepherd, Ngu Ahh Dec 2006

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Composition, Jialie Shen, John Shepherd, Ngu Ahh

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to constructing music descriptors to support efficient content-based music retrieval and classification. The system applies multiple musical properties combined with a hybrid architecture based on principal component analysis (PCA) and a multilayer perceptron neural network. This architecture enables straightforward incorporation of multiple musical feature vectors, based on properties such as timbral texture, pitch, and rhythm structure, into a single low-dimensioned vector that is more effective for classification than the larger individual feature vectors. The use of supervised training enables incorporation of human musical perception that further enhances the classification process. We compare …

Go to article

Continuous Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim Dec 2006

Continuous Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. In these applications, continuous query processing is often required and their efficient evaluation is a critical requirement to be met. Due to the limited power supply for sensor nodes, energy efficiency is a major performance measure in such query evaluation. In this paper, we focus on continuous kNN query processing. We observe that the centralized data storage and monitoring schemes do not favor energy efficiency. We therefore propose a localized scheme to monitor long running nearest neighbor queries in sensor networks. …

Go to article

A Model For Anticipatory Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim Nov 2006

A Model For Anticipatory Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Event detection is a very important area of research that discovers new events reported in a stream of text documents. Previous research in event detection has largely focused on finding the first story and tracking the events of a specific topic. A topic is simply a set of related events defined by user supplied keywords with no associated semantics and little domain knowledge. We therefore introduce the Anticipatory Event Detection (AED) problem: given some user preferred event transition in a topic, detect the occurence of the transition for the stream of news covering the topic. We confine the events to …

Go to article

Understanding User Perceptions On Usefulness And Usability Of An Integrated Wiki-G-Portal, Yin-Leng Theng, Yuanyuan Li, Ee Peng Lim, Zhe Wang, Dion Hoe-Lian Goh, Chew-Hung Chang, Kalyani Chatterjea, Jun Zhang Nov 2006

Understanding User Perceptions On Usefulness And Usability Of An Integrated Wiki-G-Portal, Yin-Leng Theng, Yuanyuan Li, Ee Peng Lim, Zhe Wang, Dion Hoe-Lian Goh, Chew-Hung Chang, Kalyani Chatterjea, Jun Zhang

Research Collection School Of Computing and Information Systems

This paper describes a pilot study on Wiki-G-Portal, a project integrating Wikipedia, an online encyclopedia, into G-Portal, a Web-based digital library, of geography resources. Initial findings from the pilot study seemed to suggest positive perceptions on usefulness and usability of Wiki-G-Portal, as well as subjects' attitude and intention to use.

Go to article

Integration Of Wikipedia And A Geography Digital Library, Ee Peng Lim, Zhe Wang, Darwin Sadeli, Yuanyuan Li, Chew-Hung Chang, Kalyani Chatterjea, Dion Hoe-Lian Goh, Yin-Leng Theng, Jun Zhang, Aixin Sun Nov 2006

Integration Of Wikipedia And A Geography Digital Library, Ee Peng Lim, Zhe Wang, Darwin Sadeli, Yuanyuan Li, Chew-Hung Chang, Kalyani Chatterjea, Dion Hoe-Lian Goh, Yin-Leng Theng, Jun Zhang, Aixin Sun

Research Collection School Of Computing and Information Systems

In this paper, we address the problem of integrating Wikipedia, an online encyclopedia, and G-Portal, a web-based digital library, in the geography domain. The integration facilitates the sharing of data and services between the two web applications that are of great value in learning. We first present an overall system architecture for supporting such an integration and address the metadata extraction problem associated with it. In metadata extraction, we focus on extracting and constructing metadata for geo-political regions namely cities and countries. Some empirical performance results will be presented. The paper will also describe the adaptations of G-Portal and Wikipedia …

Go to article

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang Oct 2006

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method …

Go to article

First Prev Next Last