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

DOI10.1016/J.COR.2013.09.018MaRDI QIDQ337219zbMATH OpenOpenAlexFDO

Authors 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

data mininginteger programmingvariable neighbourhood searchassociation rule with time-window

Mathematics Subject Classification ID

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

Recommendations

• Discovering frequent itemset with maximum time-window on temporal transaction database using variable neighborhood search
• Temporal association rules mining algorithm based on frequent item sets tree

Cites work

• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• Association rule mining. Models and algorithms
• Mining hybrid sequential patterns and sequential rules
• Neighborhood search techniques for solving 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
• Variable neighborhood search for the p-median
• Variable neighborhood search: Principles and applications

Cited in

(1)

• Discovering frequent itemset with maximum time-window on temporal transaction database using variable neighborhood search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337219)