Learn 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)
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)
  • Mark R Vossler, Hong Yao, Randall D York, Ming-Gui Pan, Caroline S Rim, Philip J.S Stork
  • 1997
Cyclic adenosine monophosphate (cAMP) has tissue-specific effects on growth, differentiation, and gene expression. We show here that cAMP can activate the transcription factor Elk-1 and induce neuronal differentiation of PC12 cells via its activation of the MAP kinase cascade. These cell type-specific actions of cAMP require the expression of the(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)
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)
The nature of the pseudogap phase of cuprate high-temperature superconductors is a major unsolved problem in condensed matter physics. We studied the commencement of the pseudogap state at temperature T* using three different techniques (angle-resolved photoemission spectroscopy, polar Kerr effect, and time-resolved reflectivity) on the same optimally doped(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)
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)