At present, the recommendation of information for travel is concentrating on two parts: personalized travel recommendations and classic travel recommendations. However, the interaction relationship between the user pr...
详细信息
At present, the recommendation of information for travel is concentrating on two parts: personalized travel recommendations and classic travel recommendations. However, the interaction relationship between the user preference and the classic attractions should also be taken into consideration. Comprehensive the above consideration, this essay propose a more effective and precise algorithm named CIAP (Combination of Interest and Popularity), which based on personal interests and attractions popularity. This algorithm extracts users' interest matrix from users' GPS trajectories to build a core user model. Based on this mode, CAIP defines user similarity function and attractions popular degree function, then CIAP gets the optimal results of recommendation by determining similarity of user's attractions weight and attractions popularity weight. We evaluate the recommended effect of CIAP algorithm in different weight based on GPS data which is collected in the Geolife project (Microsoft Research Asia), that show our method has a better comprehensive performance.
With the emergence of new applications, the traditional methods of mining frequent itemsets are confronted with enormous challenges in uncertain environment. As one of the most classic algorithms, Eclat algorithm is r...
详细信息
With the emergence of new applications, the traditional methods of mining frequent itemsets are confronted with enormous challenges in uncertain environment. As one of the most classic algorithms, Eclat algorithm is regarded as a promising approach whose efficiency is experimentally proved in mining expected support-based frequent itemsets, while it has not received much attention in the area of mining probabilistic frequent itemsets. In this paper, we review the previous efficient algorithms in the research of frequent itemsets mining over uncertain databases, and then we propose a vertical mining algorithm with Eclat framework, which can mine all probabilistic frequent itemsets exactly and efficiently. In order to study its performance, we design different experiments to evaluate its performance on both synthetic and real data sets, which shows that the vertical mining algorithm is simple to implement and perform well in practice.
The performance of content-based image retrieval is degraded because of the existence of the semantic gap. In order to address this drawback, this paper proposes an image retrieval method fusing with the semantic conc...
详细信息
The performance of content-based image retrieval is degraded because of the existence of the semantic gap. In order to address this drawback, this paper proposes an image retrieval method fusing with the semantic concept and the weighted visual feature. In the approach, each image is segmented using the normalized cut (N-cut), and the visual characteristics are extracted. After that, the semantic concept is achieved based on the mapping from keywords to image low-level characteristics. The distinctive proportion of the same concept in different images may lead to the priority retrieval of the image which has the same similarity and smaller correlated regions with others. Therefore, we use the weighted visual features to sort the retrieved images. Extensive experiments show the retrieval performance of the proposed method is superior to the traditional content-based image retrieval methods.
To improve the accuracy of image retrieval, a two-stage method for annotation-based image retrieval is proposed. In the approach, images are ranked using their attached text information at the first stage, and Content...
详细信息
Nowadays it is difficult to get overall sentiment orientation of the comment text. To solve this problem, in the paper, the method of multi-document sentiment summarization based on model Latent Dirichlet Allocation (...
详细信息
To solve the problem of authorization inflexibility and the problem of coarse-grained attribute revocation exist in the attribute based access control model, a kind of improved attribute based access control model whi...
详细信息
Wireless communications have become one of the most key parts in our everyday life, which give us facility on work and life but they still bring a great security risk. A crucial problem with wireless communications is...
详细信息
Wireless communications have become one of the most key parts in our everyday life, which give us facility on work and life but they still bring a great security risk. A crucial problem with wireless communications is to ensure the security of communication and prevent the privacy of communication entities revealing. Authentication is becoming an important issue when a mobile user (MU) wants to access services provided by the home agent (HA) in a visited foreign agent (FA). Recently, Kuo et al. proposed an authentication scheme and claimed that the proposed scheme was secure against different kinds of attacks. In this paper, we show that Kuo et al.'s scheme fails to resist insider and verifier attacks while it does not provide local verification. In addition, password change phase of Kuo et al.'s scheme also has a loophole. To remedy these shortcomings, an improved anonymous authentication scheme for wireless communications is proposed which is immune to various known types of attacks. Finally, in comparison with other existing schemes regarding security properties and performance, we show that our scheme has various kinds of security properties and is suitable for practical applications in wireless networks.
This note presents the sub-optimal linear-quadratic controller for a discretetime system with multiple control input delays. Sub-optimality of the solution is designed in two steps. First, a delay-free transformed sys...
详细信息
Reconstruction Method of Network Forensics Scenario has grown into a mature and rich technology that provides advanced skills to get the chain of evidence. Using statistical methods to analyze intrusion logs in order ...
详细信息
Reconstruction Method of Network Forensics Scenario has grown into a mature and rich technology that provides advanced skills to get the chain of evidence. Using statistical methods to analyze intrusion logs in order to present evidentiary values in court are often refuted as baseless and inadmissible evidences which is not considering the input spent. These spendings is to generate the reports no matter they are well-grounded evidences or not. Thus, this paper presents the Scenario Reconstruction Method combines the Viterbi algorithm, the most likely sequence of Meta evidence which replaces the Meta evidence was acquired. With suspected evidence, thus obtaining the chain of evidence. However, the Viterbi algorithm parameters is derived from the Baum-Welch (B-W) algorithm, and the B-W algorithm is easy to fall into local optima solution. While an Adaptive Genetic Algorithm (AGA) is used to estimate parameters of the Hidden Markov model (HMM), where Chromosome coding method and genetic operation mode are designed. The experimental results show that, this method can accurately reproduce the crime scene of network intrusion, compared with the network forensic evidence fusion method which is based on the HMM. The method has been applied to forensics system, and has obtained good result.
In this work, we present a new anonymous HIBE scheme which is unbounded in the sense that the public parameters do not impose additional limitations on the functionality of the systems. In most of previous constructio...
详细信息
暂无评论