In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not...
详细信息
ISBN:
(纸本)9781450324694
In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not suffer from these problems. In the proposed approach, each target object is represented by a vector. The elements of the vector denote all the objects in the given data set, and the value of each element indicates the weight of the corresponding object with respect to the target object. As for this weight value, we propose to utilize the probability of reaching from the target object to the specific object, computed using the "Random Walk with Restart" strategy. Then, we define the similarity between two objects as the cosine similarity of the two vectors representing the two objects. We also evaluate the performance of the proposed approach in comparison with existing link-based measures using two kinds of data sets. Our experimental results show that the proposed approach significantly outperform the existing measures. Copyright 2014 ACM.
The state-of-the-art mobile visual search approaches are based on the bag-of-visual-word (BoW). As BoW representation ignores geometric relationship among the local features, a full geometric constraint like RANSAC is...
详细信息
The objective of this research is to shed light on the applicability of the Non-Functional Requirements (NFR) Approach to the concept of control chains for the combined analysis of safety and security of SCADA systems...
详细信息
Recently, object-oriented (OO) frameworks have been known to be highly effective and practical for software reuse;as shown in San Francisco project, a large-scaled industry project for framework development. However, ...
详细信息
We investigate the challenge of extracting information about genetic mutations from tables, an important source of information in scientific papers. We use various machine learning algorithms and feature sets, and eva...
详细信息
Global warming has increased large-scale natural disasters at an alarmingly greater frequency. These natural disasters affect humans and the ecosystems that all species rely upon for food and shelter. A significant by...
详细信息
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a probability distribution over the syste...
详细信息
A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditions. This limitation is particularly frus...
详细信息
The rapid evolution of autonomous and connected vehicles has led to their integration with numerous technologies and software, rendering them vulnerable targets for cybersecurity attacks. While efforts have traditiona...
详细信息
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most o...
详细信息
ISBN:
(纸本)9781605583235
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most of these constrained TPS cannot be directly answered by any of the existing algorithms. By formulating each restriction into rules, we propose a novel form of route query, namely the multi-rule partial sequenced route (MRPSR) query. Our work provides a unified framework that also subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. In this paper, we first prove that MRPSR is NP-hard and then present three heuristic algorithms to search for near-optimal solutions for the MRPSR query. Our extensive simulations show that all of the proposed algorithms can answer the MRPSR query effectively and efficiently. Using both real and synthetic datasets, we investigate the performance of our algorithms with the metrics of the route distance and the response time in terms of the percentage of the constrained points of interest (POI) categories. Compared to the LORD-based brute-force solution, the response times of our algorithms are remarkably reduced while the resulting route length is only slightly longer than the shortest route. Copyright 2008 ACM.
暂无评论