Sciweavers

2227 search results - page 92 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 29 days ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 8 days ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
PC
2007
141views Management» more  PC 2007»
15 years 2 months ago
Physically based simulation of cloth on distributed memory architectures
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
Bernhard Thomaszewski, Wolfgang Blochinger
143
Voted
FIMI
2003
210views Data Mining» more  FIMI 2003»
15 years 4 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
VLDB
1997
ACM
169views Database» more  VLDB 1997»
15 years 7 months ago
Mining Insurance Data at Swiss Life
Huge masses of digital data about products, customers and competitors have become available for companies in the services sector. In order to exploit its inherent (and often hidde...
Jörg-Uwe Kietz, Ulrich Reimer, Martin Staudt