Sciweavers

621 search results - page 27 / 125
» Global partial orders from sequential data
Sort
View
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
15 years 11 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant
DEBS
2007
ACM
14 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
97
Voted
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
AIME
2005
Springer
14 years 11 months ago
An Algorithm to Learn Causal Relations Between Genes from Steady State Data: Simulation and Its Application to Melanoma Dataset
In recent years, a few researchers have challenged past dogma and suggested methods (such as the IC algorithm) for inferring causal relationship among variables using steady state ...
Xin Zhang, Chitta Baral, Seungchan Kim
UAI
2008
14 years 11 months ago
Modelling local and global phenomena with sparse Gaussian processes
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
Jarno Vanhatalo, Aki Vehtari