Sciweavers

298 search results - page 14 / 60
» Summarizing itemset patterns using probabilistic models
Sort
View
JAIR
1998
198views more  JAIR 1998»
13 years 7 months ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
Ishanu Chattopadhyay, Yicheng Wen, Asok Ray
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
FLAIRS
2007
13 years 10 months ago
A Decision Theoretic View on Choosing Heuristics for Discovery of Graphical Models
Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
Yang Xiang
AAAI
2012
11 years 10 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb