Sciweavers

216 search results - page 30 / 44
» Compression-based data mining of sequential data
Sort
View
CIB
2002
100views more  CIB 2002»
13 years 8 months ago
Web-log Mining for Quantitative Temporal-Event Prediction
The web log data embed much of web users' browsing behavior. From the web logs, one can discover patterns that predict the users' future requests based on their current b...
Qiang Yang, Hui Wang, Wei Zhang
ICTAI
2003
IEEE
14 years 1 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
PAKDD
2009
ACM
124views Data Mining» more  PAKDD 2009»
14 years 3 months ago
Dynamic Exponential Family Matrix Factorization
Abstract. We propose a new approach to modeling time-varying relational data such as e-mail transactions based on a dynamic extension of matrix factorization. To estimate effectiv...
Kohei Hayashi, Junichiro Hirayama, Shin Ishii
KES
2004
Springer
14 years 2 months ago
Consumer Behavior Analysis by Graph Mining Technique
In this paper we discuss how graph mining system is applied to sales transaction data so as to understand consumer behavior. First, existing research of consumer behavior analysis ...
Katsutoshi Yada, Hiroshi Motoda, Takashi Washio, A...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 1 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...