Sciweavers

322 search results - page 58 / 65
» Mining Frequent Tree-Like Patterns in Large Datasets
Sort
View
EOR
2007
96views more  EOR 2007»
13 years 7 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
ICDE
2007
IEEE
107views Database» more  ICDE 2007»
14 years 2 months ago
An Integrated Platform for Spatial Data Mining within a GIS Environment
The strength of GIS is in providing a rich data infrastructure for combining disparate data in meaningful ways by using a spatial arrangement (e.g., proximity). As a toolbox, a GI...
Annalisa Appice, Antonietta Lanza, Donato Malerba
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
KDD
2004
ACM
237views Data Mining» more  KDD 2004»
14 years 8 months ago
Bayesian Model-Averaging in Unsupervised Learning From Microarray Data
Unsupervised identification of patterns in microarray data has been a productive approach to uncovering relationships between genes and the biological process in which they are in...
Mario Medvedovic, Junhai Guo
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...