Cast2face: Character Identification In Movie With Actor-Character Correspondence,
2010
National University of Singapore
Cast2face: Character Identification In Movie With Actor-Character Correspondence, Mengdi Xu, Xiaotong Yuan, Jialie Shen, Shuicheng Yan
Research Collection School Of Computing and Information Systems
We investigate the problem of automatically identifying characters in a movie with the supervision of actor-character name correspondence provided by the movie cast. Our proposed framework, namely Cast2Face, is featured by: (i) we restrict the names to assign within the set of character names in the cast; (ii) for each character, by using the corresponding actor's name as a key word, we retrieve from Google image search a group of face images to form the gallery set; and (iii) the probe face tracks in the movie are then identified as one of the actors by robust multi-task joint sparse representation …
Rich Internet Geoweb For Spatial Data Infrastructure,
2010
Singapore Management University
Rich Internet Geoweb For Spatial Data Infrastructure, Tin Seong Kam
Research Collection School Of Computing and Information Systems
In this information age, more and more public statistical data such as population census, household living, local economy and business establishment are distributed over the internet within the framework of spatial data infrastructure. By and large, these data are organized geographically such as region, province as well as district. Usually, they are published in the form of digital maps over the internet as simple points, lines and polygons markers limited or no analytical function available to transform these data into useful information. To meet the analytical needs of casual public data users, we contribute RIGVAT, a rich internet geospatial visual …
Detecting Product Review Spammers Using Rating Behaviors,
2010
Singapore Management University
Detecting Product Review Spammers Using Rating Behaviors, Ee Peng Lim, Viet-An Nguyen, Nitin Jindal, Bing Liu, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
This paper aims to detect users generating spam reviews or review spammers. We identify several characteristic be- haviors of review spammers and model these behaviors so as to detect the spammers. In particular, we seek to model the following behaviors. First, spammers may target specific products or product groups in order to maximize their im- pact. Second, they tend to deviate from the other reviewers in their ratings of products. We propose scoring methods to measure the degree of spam for each reviewer and apply them on an Amazon review dataset. We then select a sub- set of highly suspicious …
Program Transformations For Information Personalization,
2010
University of Dayton
Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …
A Taxonomy-Based Model For Expertise Extrapolation,
2010
Wright State University - Main Campus
A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth
Kno.e.sis Publications
While many ExpertFinder applications succeed in finding experts, their techniques are not always designed to capture the various levels at which expertise can be expressed. Indeed, expertise can be inferred from relationships between topics and subtopics in a taxonomy. The conventional wisdom is that expertise in subtopics is also indicative of expertise in higher level topics as well. The enrichment of Expertise Profiles for finding experts can therefore be facilitated by taking domain hierarchies into account. We present a novel semantics-based model for finding experts, expertise levels and collaboration levels in a peer review context, such as composing a Program …
Ranking Documents Semantically Using Ontological Relationships,
2010
Wright State University - Main Campus
Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth
Kno.e.sis Publications
Although arguable success of today’s keyword based search engines in certain information retrieval tasks, ranking search results in a meaningful way remains an open problem. In this work, the goal is to use of semantic relationships for ranking documents without relying on the existence of any specific structure in a document or links between documents. Instead, real-world entities are identified and the relevance of documents is determined using relationships that are known to exist between the entities in a populated ontology. We introduce a measure of relevance that is based on traversal and the semantics of relationships that link entities …
Investigating Ultrasonic Positioning On Mobile Phones,
2010
Technological University Dublin
Investigating Ultrasonic Positioning On Mobile Phones, Viacheslav Filonenko, Charlie Cullen, James Carswell
Conference papers
In this paper we evaluate the innate ability of mobile phone speakers to produce ultrasound and the possible uses of this ability for accurate indoor positioning. The frequencies in question are a range between 20 and 22 KHz, which is high enough to be inaudible but low enough to be generated by standard sound hardware. A range of tones is generated at different volume settings on several popular modern mobile phones with the aim of finding points of failure. Our results indicate that it is possible to generate the given range of frequencies without significant distortions, provided the signal volume …
Context-Aware Query Recommendations,
2010
Singapore Management University
Context-Aware Query Recommendations, Alexandros Ntoulas, Heasoo Hwang, Lise Getoor, Stelios Paparizos, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Described is a search-related technology in which context information regarding a user's prior search actions is used in making query recommendations for a current user action, such as a query or click. To determine whether each set or subset of context information is relevant to the user action, data obtained from a query log is evaluated. More particularly, a query transition (query-query) graph and a query click (query-URL) graph are extracted from the query log; vectors are computed for the current action and each context/sub-context and evaluated against vectors in the graphs to determine current action-to-context similarity. Also described is …
Shortest Path Computation On Air Indexes,
2010
Singapore Management University
Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and …
Embellishing Text Search Queries To Protect User Privacy,
2010
Singapore Management University
Embellishing Text Search Queries To Protect User Privacy, Hwee Hwa Pang, Xuhua Ding, Xiaokui Xiao
Research Collection School Of Computing and Information Systems
Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable for a search engine to perform document retrieval for users while protecting their intent. In this paper, we identify the privacy risks arising from semantically related search terms within a query, and from recurring highspecificity query terms in a search session. To counter the risks, we propose a solution for a similarity text retrieval system to offer anonymity and plausible deniability for the query terms, and hence the user intent, without degrading the system’s precision-recall …
Diract: Agent-Based Interactive Storytelling,
2010
Singapore Management University
Diract: Agent-Based Interactive Storytelling, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
A lot of researches haven been done on the interactive storytelling authoring , e.g. by a director agent, or by interactions among a number of character agents. However, it is still difficult to construct the interactive storytelling for novice users, due to a need of various agents development and complex communication among the agents. We propose an agent-based interactive storytelling architecture, namely DIRACT (short of “Direct and Act”). It is composed of numerous atomic DIRACT agents, which are goal oriented and use an unified communication protocol. By removing the difference between the director and character, each DIRACT agent can either …
P2pdoctagger: Content Management Through Automated P2p Collaborative Tagging,
2010
Nanyang Technological University
P2pdoctagger: Content Management Through Automated P2p Collaborative Tagging, Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
As the amount of user generated content grows, personal information management has become a challenging problem. Several information management approaches, such as desktop search, document organization and (collaborative) document tagging have been proposed to address this, however they are either inappropriate or inefficient. Automated collaborative document tagging approaches mitigate the problems of manual tagging, but they are usually based on centralized settings which are plagued by problems such as scalability, privacy, etc. To resolve these issues, we present P2PDocTagger, an automated and distributed document tagging system based on classification in P2P networks. P2P-DocTagger minimizes the efforts of individual peers and …
3dq: Threat Dome Visibility Querying On Mobile Devices,
2010
Technological University Dublin
3dq: Threat Dome Visibility Querying On Mobile Devices, James Carswell, Keith Gardiner, Junjun Yin
Articles
3DQ (Three Dimensional Query) is our mobile spatial interaction (MSI) prototype for location and orientation aware mobile devices (i.e. today's sensor enabled smartphones). The prototype tailors a military style threat dome query calculation using MSI with hidden query removal functionality for reducing “information overload” on these off-the-shelf devices. The effect gives a more accurate and expected query result for Location-Based Services (LBS) applications by returning information on only those objects visible within a user’s 3D field-of-view. Our standardised XML based request/response design enables any mobile device, regardless of operating system and/or programming language, to access the 3DQ web-service interfaces.
Virtualisation: A Case Study In Database Administration Laboratory Work,
2010
Bond University
Virtualisation: A Case Study In Database Administration Laboratory Work, Greg Cranitch, Michael J. Rees
Greg Cranitch
This paper discusses the issues involved in using virtual machines to teach database administration concepts and the associated issues in a university student environment. Previous work on using virtual machines in system/network administration university labs is reviewed as well as the use of virtual machines in a database development environment. A virtual machine project for a Virtual Information Technology Teaching Laboratory (VITTL) using central servers offering a potential solution is described. This solution provides a secure environment with each student isolated from others with their own virtual machines.
Penetration Testing And Vulnerability Assessments: A Professional Approach,
2010
University of Glamorgan
Penetration Testing And Vulnerability Assessments: A Professional Approach, Konstantinos Xynos, Iain Sutherland, Huw Read, Emlyn Everitt, Andrew J C Blyth
International Cyber Resilience conference
Attacks against computer systems and the data contained within these systems are becoming increasingly frequent and evermore sophisticated. So-called “zero-day” exploits can be purchased on black markets and Advanced Persistent Threats (APTs) can lead to exfiltration of data over extended periods. Organisations wishing to ensure security of their systems may look towards adopting appropriate measures to protect themselves against potential security breaches. One such measure is to hire the services of penetration testers (or “pen-tester”) to find vulnerabilities present in the organisation’s network, and provide recommendations as to how best to mitigate such risks. This paper discusses the definition and …
Expert System For Online Diagnosis Of Red-Eye Diseases,
2010
Gomal University, Dera Ismail Khan
Expert System For Online Diagnosis Of Red-Eye Diseases, Dr. Muhammad Zubair Asghar, Muhammad Junaid Asghar
Dr. Muhammad Zubair Asghar
This paper describes Expert System (ES) for online diagnosis and prescription of red-eye diseases. The types of eye diseases that can be diagnosed with this system are called Red-eye diseases i.e. disease in which red-eye is the common symptom. It is rule based web-supported expert system, assisting ophthalmologists, medical students doing specialization in ophthalmology, researchers as well as eye patients having computer know-how. System was designed and programmed with Java Technology. The expert rules were developed on the symptoms of each type of Red-eye disease, and they were presented using tree-graph and inferred using forward-chaining with depth-first search method. User …
A Comparative Study Of Threshold-Based Feature Selection Techniques,
2010
Western Kentucky University
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
Dr. Huanjing Wang
Abstract Given high-dimensional software measurement data, researchers and practitioners often use feature (metric) selection techniques to improve the performance of software quality classification models. This paper presents our newly proposed threshold-based feature selection techniques, comparing the performance of these techniques by building classification models using five commonly used classifiers. In order to evaluate the effectiveness of different feature selection techniques, the models are evaluated using eight different performance metrics separately since a given performance metric usually captures only one aspect of the classification performance. All experiments are conducted on three Eclipse data sets with different levels of class imbalance. The …
A Comparative Study Of Filter-Based Feature Ranking Techniques,
2010
Western Kentucky University
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
Dr. Huanjing Wang
One factor that affects the success of machine learning is the presence of irrelevant or redundant information in the training data set. Filter-based feature ranking techniques (rankers) rank the features according to their relevance to the target attribute and we choose the most relevant features to build classification models subsequently. In order to evaluate the effectiveness of different feature ranking techniques, a commonly used method is to assess the classification performance of models built with the respective selected feature subsets in terms of a given performance metric (e.g., classification accuracy or misclassification rate). Since a given performance metric usually can …
Cross-Market Model Adaptation With Pairwise Preference Data For Web Search Ranking,
2010
Wright State University - Main Campus
Cross-Market Model Adaptation With Pairwise Preference Data For Web Search Ranking, Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, Keke Chen
Kno.e.sis Publications
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this paper, we explore the adaptation of machine-learned ranking models across a set of geographically diverse markets with the market-specific pairwise preference data, which can be easily obtained from clickthrough logs. We propose a novel adaptation algorithm, Pairwise-Trada, which is able to adapt ranking models that are trained …
Pattern Space Maintenance For Data Updates And Interactive Mining,
2010
Wright State University - Main Campus
Pattern Space Maintenance For Data Updates And Interactive Mining, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong
Kno.e.sis Publications
This article addresses the incremental and decremental maintenance of the frequent pattern space. We conduct an in-depth investigation on how the frequent pattern space evolves under both incremental and decremental updates. Based on the evolution analysis, a new data structure, Generator-Enumeration Tree (GE-tree), is developed to facilitate the maintenance of the frequent pattern space. With the concept of GE-tree, we propose two novel algorithms, Pattern Space Maintainer+ (PSM+) and Pattern Space Maintainer− (PSM−), for the incremental and decremental maintenance of frequent patterns. Experimental results demonstrate that the proposed algorithms, on average, outperform the representative state-of-the-art …
