Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search

DOI10.1016/j.cor.2013.09.018zbMath1349.68170OpenAlexW2052375747MaRDI QIDQ337219

Yun Tian, Yi-Yong Xiao, Qiu Hong Zhao

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.018

zbMATH Keywords

integer programmingdata miningvariable neighbourhood searchassociation rule with time-window

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Integer programming (90C10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Variable neighborhood search
• Association rule mining. Models and algorithms
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
• Mining hybrid sequential patterns and sequential rules
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• Variable neighborhood search for the p-median
• Variable neighborhood search: Principles and applications

This page was built for publication: Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search