Discovering Frequent Itemset with Maximum Time-Window on Temporal Transaction Database using Variable Neighborhood Search

DOI10.1016/J.ENDM.2012.10.019zbMath1268.68157OpenAlexW2056121229MaRDI QIDQ2840765

Yun Tian, Yi-Yong Xiao, Qiu Hong Zhao

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.019

zbMATH Keywords

integer programmingdata miningvariable neighborhood searchassociation rule with time-window

Mathematics Subject Classification ID

Integer programming (90C10) Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Mining hybrid sequential patterns and sequential rules

This page was built for publication: Discovering Frequent Itemset with Maximum Time-Window on Temporal Transaction Database using Variable Neighborhood Search