Sciweavers

41 search results - page 6 / 9
» Finding frequent items in probabilistic data
Sort
View
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 5 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 5 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
BMCBI
2006
114views more  BMCBI 2006»
13 years 5 months ago
Mining frequent patterns for AMP-activated protein kinase regulation on skeletal muscle
Background: AMP-activated protein kinase (AMPK) has emerged as a significant signaling intermediary that regulates metabolisms in response to energy demand and supply. An investig...
Qingfeng Chen, Yi-Ping Phoebe Chen
DAS
2010
Springer
13 years 3 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
13 years 3 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu