作者:
Qing ZhuDepartment of Computer Science
Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China
Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision sup...
详细信息
ISBN:
(纸本)9781424465972;9780769540115
Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision support for Internet mediated service provision. However, most existing work assumes that all users have the same trust metrics, but in real life different users often have different preference of product attributes. This paper proposes trusted query navigation model by analyzing online customer reviews of trustworthiness of websites. The first step analyzes counting history feedback in the system offline and generates dynamic trust model by opinion classification. The second step presents trust evaluation ranking to help the user can easily discovery trust service of matching his needs. The experimental evaluation shows that the trusted query evaluation ranking has high trading efficiency, quick learning ability and satisfactory performance.
SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. More...
详细信息
SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by lever...
详细信息
ISBN:
(纸本)9781424458509
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a real-time abnormal traffic data dissemination protocol. Specifically, all vehicles running on the same road segment are regarded as a cluster to generate traffic message about this segment. To reduce communication cost, only abnormal traffic data is issued and spread to nearby road segments. By employing event-driven and period combined mechanism, the abnormal traffic messages are disseminated to the vehicles that probably need the messages in time. We propose a distance dependent forwarder selection method to disseminate traffic message. When transmitted inside a cluster, messages are forwarded along the segment from one end to the other based on the least hops principle;while transmitted among clusters, messages are transmitted in epidemic routing mode, which ensure the fast and reliable dissemination. To evaluate the performance of our protocol, we use the real traffic data of Beijing at peak hour. The simulation results demonstrate that our protocol is feasible and efficient for metropolitan-size city.
In e-business, ontology technology is used for e-commerce and e-services. The ontologies are specifications of syntax and semantics of information, which provide a shared vocabulary to facilitate online services. For ...
详细信息
According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are prop...
详细信息
In this paper, the subject of discussion is the uncertainties of Ant Colony Algorithm(ACA). In order to find application and popularize the ACA, we try to find some disciplinarians which can eliminate the impact of un...
详细信息
In this paper, a hybrid algorithm named DPSO-SA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing....
详细信息
Rule-based reasoning (RBR) and case-based reasoning (CBR) are two complementary alternatives for building knowledge-based “intelligent” decision-support systems. RBR and CBR can be combined in three main ways: RBR f...
Rule-based reasoning (RBR) and case-based reasoning (CBR) are two complementary alternatives for building knowledge-based “intelligent” decision-support systems. RBR and CBR can be combined in three main ways: RBR first, CBR first, or some interleaving of the two. The N EST system, described in this paper, allows us to invoke both components separately and in arbitrary order. In addition to the traditional network of propositions and compositional rules, N EST also supports binary, nominal, and numeric attributes used for derivation of proposition weights, logical (no uncertainty) and default (no antecedent) rules, context expressions, integrity constraints, and cases. The inference mechanism allows use of both rule-based and case-based reasoning. Uncertainty processing (based on Hájek′s algebraic theory) allows interval weights to be interpreted as a union of hypothetical cases, and a novel set of combination functions inspired by neural networks has been added. The system is implemented in two versions: stand-alone and web-based client server. A user-friendly editor covering all mentioned features is included.
Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management ...
详细信息
Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management approach. It utilizes a tree-based capability authority model to partition and delegate federated capabilities. However CBPMS delegation chains have limitations such as: performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and a lack of flexibility with respect to delegation chain reduction or capability authority re-partitioning. In this paper we introduce a trust management model for CBPMS that addresses all of these issues.. A brief security analysis is presented and a telecommunications service management use case described.
Data mining tools able to semantically interpret textual or linguistic data are acquiring a growing importance. Moreover, the development of large ontologies for general and specific domains provides new tools to incl...
详细信息
暂无评论