Sciweavers

1215 search results - page 7 / 243
» Numbers in Multi-relational Data Mining
Sort
View
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
13 years 6 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich
ITNG
2006
IEEE
14 years 2 months ago
Closed Multidimensional Sequential Pattern Mining
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...
Panida Songram, Veera Boonjing, Sarun Intakosum
CORR
2011
Springer
222views Education» more  CORR 2011»
13 years 3 hour ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 8 months ago
Finding Sequential Patterns from Large Sequence Data
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
Mahdi Esmaeili, Fazekas Gabor
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 3 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...