Sciweavers

41 search results - page 7 / 9
» Finding frequent items in probabilistic data
Sort
View
JCIT
2010
174views more  JCIT 2010»
12 years 11 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 5 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
RECSYS
2010
ACM
13 years 5 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
AAAI
2008
13 years 7 months ago
Multi-HDP: A Non Parametric Bayesian Model for Tensor Factorization
Matrix factorization algorithms are frequently used in the machine learning community to find low dimensional representations of data. We introduce a novel generative Bayesian pro...
Ian Porteous, Evgeniy Bart, Max Welling
ICEIS
2009
IEEE
13 years 2 months ago
Mining Patterns in the Presence of Domain Knowledge
One of the main difficulties of pattern mining is to deal with items of different nature in the same itemset, which can occur in any domain except basket analysis. Indeed, if we co...
Cláudia Antunes