Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Scientific Computing
Research Collection School Of Computing and Information Systems
- Keyword
-
- Data mining (2)
- Access control (1)
- Association rule mining (1)
- Classification (1)
- Client-server architecture (1)
-
- Constrained frequent episode (1)
- Data structures (1)
- E-auction (1)
- Edge computing (1)
- Edge servers (1)
- Episode mining (1)
- Episode prefix tree (1)
- I/O traffic patterns (1)
- Index structure (1)
- Indexing technique (1)
- Linux (1)
- Location-based services (1)
- Location-dependent spatial queries (1)
- Minimal occurrences (1)
- Nearest-neighbor search (1)
- Peer-to-peer (1)
- Pervasive computing (1)
- Plausible deniability (1)
- Position pairs set (1)
- Prefix-growth approach (1)
- Query scheduling (1)
- Result authentication (1)
- Roaming (1)
- Security (1)
- Semantic caching (1)
Articles 1 - 19 of 19
Full-Text Articles in Databases and Information Systems
Supporting Field Study With Personalized Project Spaces In A Geographical Digital Library, Ee Peng Lim, Aixin Sun, Zehua Liu, John Hedberg, Chew-Hung Chang, Tiong-Sa Teh, Dion Hoe-Lian Goh, Yin-Leng Theng
Supporting Field Study With Personalized Project Spaces In A Geographical Digital Library, Ee Peng Lim, Aixin Sun, Zehua Liu, John Hedberg, Chew-Hung Chang, Tiong-Sa Teh, Dion Hoe-Lian Goh, Yin-Leng Theng
Research Collection School Of Computing and Information Systems
Digital libraries have been rather successful in supporting learning activities by providing learners with access to information and knowledge. However, this level of support is passive to learners and interactive and collaborative learning cannot be easily achieved. In this paper, we study how digital libraries could be extended to serve a more active role in collaborative learning activities. We focus on developing new services to support a common type of learning activity, field study, in a geospatial context. We propose the concept of personal project space that allows individuals to work in their personalized environment with a mix of private …
Design Lessons On Access Features In Paper, Yin-Leng Theng, Dion Hoe-Lian Goh, Ming Yin, Eng-Kai Suen, Ee Peng Lim
Design Lessons On Access Features In Paper, Yin-Leng Theng, Dion Hoe-Lian Goh, Ming Yin, Eng-Kai Suen, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Using Nielsen's Heuristic Evaluation, this paper reports a user study with six usability-trained subjects to evaluate PAPER's access features in assisting users to retrieve information efficiently, part of an on-going design partnership with stakeholders and designers/developers. PAPER (Personalised Adaptive Pathways for Exam Resources) is an improved version evolving from an earlier implementation of GeogDL built upon G-Portal, a geospatial digital library infrastructure. After two initial evaluations with student and teacher design partners, PAPER has evolved into a system containing a new bundle of personalized, interactive services with four modules: mock exam; personal coach (practice and review); trend analysis and performance …
On Semantic Caching And Query Scheduling For Mobile Nearest-Neighbor Search, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
On Semantic Caching And Query Scheduling For Mobile Nearest-Neighbor Search, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
Research Collection School Of Computing and Information Systems
Location-based services have received increasing attention in recent years. In this paper, we address the performance issues of mobile nearest-neighbor search, in which the mobile user issues a query to retrieve stationary service objects nearest to him/her. An index based on Voronoi Diagram is used in the server to support such a search, while a semantic cache is proposed to enhance the access efficiency of the service. Cache replacement policies tailored for the proposed semantic cache are examined. Moreover, several query scheduling policies are proposed to address the inter-cell roaming issues in multi-cell environments. Simulations are conducted to evaluate the …
The D-Tree: An Index Structure For Planar Point Queries Location-Based Wireless Services, Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
The D-Tree: An Index Structure For Planar Point Queries Location-Based Wireless Services, Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
Research Collection School Of Computing and Information Systems
Location-based services (LBSs), considered as a killer application in the wireless data market, provide information based on locations specified in the queries. In this paper, we examine the indexing issue for querying location-dependent data in wireless LBSs; in particular, we focus on an important class of queries, planar point queries. To address the issues of responsiveness, energy consumption, and bandwidth contention in wireless communications, an index has to minimize the search time and maintain a small storage overhead. It is shown that the traditional point-location algorithms and spatial index structures fail to achieve either objective or both. This paper proposes …
Finding Constrained Frequent Episodes Using Minimal Occurrences, Xi Ma, Hwee Hwa Pang, Kian-Lee Tan
Finding Constrained Frequent Episodes Using Minimal Occurrences, Xi Ma, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Recurrent combinations of events within an event sequence, known as episodes, often reveal useful information. Most of the proposed episode mining algorithms adopt an apriori-like approach that generates candidates and then calculates their support levels. Obviously, such an approach is computationally expensive. Moreover, those algorithms are capable of handling only a limited range of constraints. In this paper, we introduce two mining algorithms - episode prefix tree (EPT) and position pairs set (PPS) - based on a prefix-growth approach to overcome the above limitations. Both algorithms push constraints systematically into the mining process. Performance study shows that the proposed algorithms …
Spatial Queries In Wireless Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
Spatial Queries In Wireless Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
Research Collection School Of Computing and Information Systems
Owing to the advent of wireless networking and personal digital devices, information systems in the era of mobile computing are expected to be able to handle a tremendous amount of traffic and service requests from the users. Wireless data broadcast, thanks to its high scalability, is particularly suitable for meeting such a challenge. Indexing techniques have been developed for wireless data broadcast systems in order to conserve the scarce power resources in mobile clients. However, most of the previous studies do not take into account the impact of location information of users. In this paper, we address the issues of …
Blocking Reduction Strategies In Hierarchical Text Classification, Ee Peng Lim, Aixin Sun, Wee-Keong Ng, Jaideep Srivastava
Blocking Reduction Strategies In Hierarchical Text Classification, Ee Peng Lim, Aixin Sun, Wee-Keong Ng, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
One common approach in hierarchical text classification involves associating classifiers with nodes in the category tree and classifying text documents in a top-down manner. Classification methods using this top-down approach can scale well and cope with changes to the category trees. However, all these methods suffer from blocking which refers to documents wrongly rejected by the classifiers at higher-levels and cannot be passed to the classifiers at lower-levels. We propose a classifier-centric performance measure known as blocking factor to determine the extent of the blocking. Three methods are proposed to address the blocking problem, namely, threshold reduction, restricted voting, and …
A Spectroscopy Of Texts For Effective Clustering, Wenyuan Li, Wee-Keong Ng, Kok-Leong Ong, Ee Peng Lim
A Spectroscopy Of Texts For Effective Clustering, Wenyuan Li, Wee-Keong Ng, Kok-Leong Ong, Ee Peng Lim
Research Collection School Of Computing and Information Systems
For many clustering algorithms, such as k-means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially true in text collections such as Web documents, images or biological data. The fundamental question this paper addresses is: ldquoHow can we effectively estimate the natural number of clusters in a given text collection?rdquo. We propose to use …
Shared-Storage Auction Ensures Data Availability, Hady W. Lauw, Siu-Cheung Hui, Edmund M. K. Lai
Shared-Storage Auction Ensures Data Availability, Hady W. Lauw, Siu-Cheung Hui, Edmund M. K. Lai
Research Collection School Of Computing and Information Systems
Most current e-auction systems are based on the client-server architecture. Such centralized systems provide a single point of failure and control. In contrast, peer-to-peer systems permit distributed control and minimize individual node and link failures' impact on the system. The shared-storage-based auction model described decentralizes services among peers to share the required processing load and aggregates peers' resources for common use. The model is based on the principles of local computation at each peer, direct inter-peer communication, and a shared storage space.
Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim
Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
This paper describes an authorization model for specifying access privileges of users who make requests to access a set of locations in a building or more generally a physical or virtual infrastructure. In the model, primitive locations can be grouped into composite locations and the connectivities among locations are represented in a multilevel location graph. Authorizations are defined with temporal constraints on the time to enter and leave a location and constraints on the number of times users can access a location. Access control enforcement is conducted by monitoring user movement and checking access requests against an authorization database. The …
A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures to improve mining efficiency. Here, we critically examine existing preprocessing data structures used in association rule mining for enhancing performance in an attempt to understand their strengths and weaknesses. Our analyses culminate in a practical structure called the SOTrielT (support-ordered trie itemset) and two synergistic algorithms to accompany it for the fast discovery …
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Research Collection School Of Computing and Information Systems
While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing …
Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang
Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang
Research Collection School Of Computing and Information Systems
In group pattern mining, we discover group patterns from a given user movement database based on their spatio-temporal distances. When both the number of users and the logging duration are large, group pattern mining algorithms become very inefficient. In this paper, we therefore propose a spherical location summarization method to reduce the overhead of mining valid 2-groups. In our experiments, we show that our group mining algorithm using summarized data may require much less execution time than that using non-summarized data.
Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan
Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure, there must be provisions for validating their outputs. This paper proposes a mechanism that creates a verification object (VO) for checking the integrity of each query result produced by an edge server - that values in the result tuples are not tampered with, and that no spurious tuples are introduced. The primary advantages of our proposed mechanism are that the VO is independent of the database size, and that …
Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Research Collection School Of Computing and Information Systems
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbors, e-distance joins and closest pairs, considering that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified …
Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis
Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1 ≤i ≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, …
An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim
An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in …
Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan
Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying …
Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
No abstract provided.