Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
Year of publication: |
2014
|
---|---|
Authors: | Xiao, Yiyong ; Tian, Yun ; Zhao, Qiu Hong |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 52.2014, B, p. 241-250
|
Subject: | Data mining | Association rule with time-window | Integer programming | Variable neighbourhood search | Data Mining | Datenbank | Database | Algorithmus | Algorithm | Ganzzahlige Optimierung | Theorie | Theory |
-
PPCI algorithm for mining temporal association rules in large databases
Pandey, Anjana, (2009)
-
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
Chung, Soon M., (2008)
-
A scalable algorithm for mining maximal frequent sequences using a sample
Luo, Congnan, (2008)
- More ...
-
Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
Xiao, Yiyong, (2012)
-
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Xiao, Yiyong, (2012)
-
A reduced variable neighbourhood search algorithm for uncapacitated multilevel lot-sizing problems
Xiao, Yiyong, (2011)
- More ...