Learn More
Most approaches to mining association rules implicitly consider the utilities of the itemsets to be equal. We assume that the utilities of itemsets may differ, and identify the high utility itemsets based on information in the transaction database and external information about utilities. Our theoretical analysis of the resulting problem lays the foundation(More)
The rationale behind mining frequent itemsets is that only itemsets with high frequency are of interest to users. However , the practical usefulness of frequent itemsets is limited by the significance of the discovered itemsets. A frequent item-set only reflects the statistical correlation between items, and it does not reflect the semantic significance of(More)
The discovery of FDs from databases has recently become a significant research problem. In this paper, we propose a new algorithm, called FD_Mine. FD_Mine takes advantage of the rich theory of FDs to reduce both the size of the dataset and the number of FDs to be checked by using discovered equivalences. We show that the pruning does not lead to loss of(More)
We propose the first join tree (JT) propagation architecture that labels the probability information passed between JT nodes in terms of conditional probability tables (CPTs) rather than potentials. By modeling the task of inference involving evidence, we can generate three work schedules that are more time-efficient for LAZY propagation. Our experimental(More)
There has been significant progress in the development and deployment of Peer-to-Peer (P2P) live video streaming systems. However, there has been little study on the security aspect in such systems. Our prior experiences in Anysee exhibit that existing systems are largely vulnerable to intermediate attacks, in which the content pollution is a common attack(More)
—Service provisioning has been widely regarded as a critical issue to quality-of-service (QoS) of cloud services in datacenters. Conventional studies on service provisioning mainly focus on task mapping, i.e., how to distribute the service-oriented tasks onto the servers to achieve different goals, e.g., makespan minimization. In distributed datacenters, a(More)
Current join tree propagation algorithms treat all propagated messages as being of equal importance. On the contrary, it is often the case in real-world Bayesian networks that only some of the messages propagated from one join tree node to another are relevant to subsequent message construction at the receiving node. In this article , we propose the first(More)