Sciweavers

767 search results - page 98 / 154
» On Clustering Using Random Walks
Sort
View
GFKL
2004
Springer
107views Data Mining» more  GFKL 2004»
14 years 1 months ago
Hierarchical Mixture Models for Nested Data Structures
A hierarchical extension of the finite mixture model is presented that can be used for the analysis of nested data structures. The model permits a simultaneous model-based cluster...
Jeroen K. Vermunt, Jay Magidson
VLDB
1998
ACM
132views Database» more  VLDB 1998»
13 years 12 months ago
Buffering and Read-Ahead Strategies for External Mergesort
The elapsed time for external mergesort is normally dominated by I/O time. This paper is focused on reducing I/O time during the merge phase. Three new buffering and readahead str...
Weiye Zhang, Per-Åke Larson
NIPS
2004
13 years 9 months ago
Detecting Significant Multidimensional Spatial Clusters
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
Daniel B. Neill, Andrew W. Moore, Francisco Pereir...
CORR
2004
Springer
218views Education» more  CORR 2004»
13 years 7 months ago
A Dynamic Clustering-Based Markov Model for Web Usage Mining
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
José Borges, Mark Levene
ICASSP
2011
IEEE
12 years 11 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu