Sciweavers

161 search results - page 15 / 33
» Workshop on massive 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,...
GRAPHICSINTERFACE
2009
13 years 5 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...
JMLR
2012
11 years 9 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
ICPR
2006
IEEE
14 years 8 months ago
Scalable Representative Instance Selection and Ranking
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
Xindong Wu, Xingquan Zhu
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
14 years 2 months ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...