database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partit...
详细信息
ISBN:
(纸本)9781605586502
database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion;second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts. Copyright 2009 ACM.
Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influen...
详细信息
ISBN:
(纸本)9781424427659
Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.
This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum ...
详细信息
Along with a massive amount of information being placed online, it is a challenge to exploit the internal and external information of documents when assessing similarity between them. A variety of approaches have been...
详细信息
In many real-world domains, link graph is one of the most effective ways to model the relationships between objects. Measuring the similarity of objects in a link graph is studied by many researchers, but an effective...
详细信息
Nearly all text classification methods classify texts into predefined categories according to the terms appeared in texts. State-of-the-art of text classification prefer to simplely take a word as a term since it perf...
详细信息
Dependence is a common relationship between objects. Many works have paid their attentions on dependence, but many of them mainly focus on constructing or exploiting dependence graphs on some specific domain. In this ...
详细信息
Classification is an important subject in data mining and machine learning, which has been studied extensively and has a wide range of applications. Classification based on association rules is one of the most effecti...
详细信息
ISBN:
(纸本)9780769538174
Classification is an important subject in data mining and machine learning, which has been studied extensively and has a wide range of applications. Classification based on association rules is one of the most effective classification method, whose accuracy is higher and discovered rules are easier to understand comparing with classical classification methods. However, current algorithms for classification based on association rules is single table oriented, which means they can only apply to the data stored in a single relational table. Directly applying these algorithms in multi-relational data environment will result in many problems. This paper proposes a novel algorithm MrCAR for classification based on association rules in multi-relational data environment. MrCAR mines relevant features in each table to predict the class label. Close itemsets technique and Tuple ID Propagation method are used to improve the performance of the algorithm. Experimental results show that MrCAR has higher accuracy and better understandability comparing with a typical existing multirelational classification algorithm.
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in ...
详细信息
ISBN:
(纸本)9781424452422
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.
Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advanta...
详细信息
Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advantages in business goals and requirements analysis, and the corresponding services' definition, extraction, optimization and integration. Through the combination, system flexibility, rapidity and accuracy could be achieved. The establishment of Service Repository according to the business requirements, is a crucial part in the architecture, however there are no definite rules for service extraction. In this paper, the detailed activities and steps, as well as a specific establishment case is illustrated. At last, architecture based on BPM and SOA for the apparel trade quotation is put forward, and its composition and implement are also analyzed.
暂无评论