Sciweavers

213 search results - page 28 / 43
» Sequential PAttern mining using a bitmap representation
Sort
View
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
14 years 24 days ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 24 days 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...
CORR
2011
Springer
229views Education» more  CORR 2011»
13 years 2 months ago
"Improved FCM algorithm for Clustering on Web Usage Mining"
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
K. Suresh
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
11 years 10 months ago
Differentially private transit data publication: a case study on the montreal transportation system
With the wide deployment of smart card automated fare collection (SCAFC) systems, public transit agencies have been benefiting from huge volume of transit data, a kind of sequent...
Rui Chen, Benjamin C. M. Fung, Bipin C. Desai, N&e...
DAGSTUHL
2007
13 years 9 months ago
Discovering Knowledge from Local Patterns with Global Constraints
It is well known that local patterns are at the core of a lot of knowledge which may be discovered from data. Nevertheless, use of local patterns is limited by their huge number an...
Bruno Crémilleux, Arnaud Soulet