Sciweavers

298 search results - page 2 / 60
» Summarizing itemset patterns using probabilistic models
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
A comparative study of probabilistic ranking models for spoken document summarization
The purpose of extractive document summarization is to automatically select a number of indicative sentences, passages, or paragraphs from the original document according to a tar...
Shih-Hsiang Lin, Yi-Ting Chen, Hsin-Min Wang, Bin ...
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
14 years 1 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
MCS
2004
Springer
14 years 1 months ago
A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Hanan Ayad, Otman A. Basir, Mohamed Kamel
PAKDD
2007
ACM
148views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Mining Frequent Itemsets from Uncertain Data
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
Chun Kit Chui, Ben Kao, Edward Hung
SAC
2006
ACM
14 years 1 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht