Sciweavers

321 search results - page 60 / 65
» Additive Pattern Database Heuristics
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 1 months ago
Learning to predict train wheel failures
This paper describes a successful but challenging application of data mining in the railway industry. The objective is to optimize maintenance and operation of trains through prog...
Chunsheng Yang, Sylvain Létourneau
ACMICEC
2004
ACM
171views ECommerce» more  ACMICEC 2004»
14 years 1 months ago
Efficient integration of web services with distributed data flow and active mediation
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
David Liu, Jun Peng, Kincho H. Law, Gio Wiederhold
SIGMOD
2010
ACM
189views Database» more  SIGMOD 2010»
14 years 12 days ago
Recsplorer: recommendation algorithms based on precedence mining
We study recommendations in applications where there are temporal patterns in the way items are consumed or watched. For example, a student who has taken the Advanced Algorithms c...
Aditya G. Parameswaran, Georgia Koutrika, Benjamin...
PPDP
2010
Springer
13 years 6 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...