CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction

Date

2016-05-20

Author

Alkan, Oznur Kirmemis
Karagöz, Pınar

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

105
views

0
downloads

This paper presents efficient data structures and a pruning technique in order to improve the efficiency of high utility sequential pattern mining. CRoM (Cumulated Rest of Match) based upper bound, which is a tight upper bound on the utility of the candidates is proposed in order to perform more conservative pruning before candidate pattern generation in comparison to the existing techniques. In addition, an efficient algorithm, HuspExt (High Utility Sequential Pattern Extraction), is presented which calculates the utilities of the child patterns based on that of the parents'. Substantial experiments on both synthetic and real datasets from different domains show that, the solution efficiently discovers high utility sequential patterns under low thresholds.

URI

https://hdl.handle.net/11511/55819

Conference Name

32nd IEEE International Conference on Data Engineering (ICDE)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

CRoM and HuspExt Improving efficiency of high utility sequential pattern extraction Kirmemis Alkan, Öznur; Karagöz, Pınar (2016-05-10) This paper presents efficient data structures and a pruning technique in order to improve the efficiency of high utility sequential pattern mining. CRoM (Cumulated Rest of Match) based upper bound, which is a tight upper bound on the utility of the candidates is proposed in order to perform more conservative pruning before candidate pattern generation in comparison to the existing techniques. In addition, an efficient algorithm, HuspExt (High Utility Sequential Pattern Extraction), is presented which calcul...
CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction Alkan, Oznur Kirmemis; Karagöz, Pınar (Institute of Electrical and Electronics Engineers (IEEE), 2015-10-1) High utility sequential pattern mining has been considered as an important research problem and a number of relevant algorithms have been proposed for this topic. The main challenge of high utility sequential pattern mining is that, the search space is large and the efficiency of the solutions is directly affected by the degree at which they can eliminate the candidate patterns. Therefore, the efficiency of any high utility sequential pattern mining solution depends on its ability to reduce this big search ...
Optimising a nonlinear utility function in multi-objective integer programming Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01) In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...
Convexity constrained efficient superpixel and supervoxel extraction Tasli, H. Emrah; Çiğla, Cevahir; Alatan, Abdullah Aydın (2015-04-01) This paper presents an efficient superpixel (SP) and supervoxel (SV) extraction method that aims improvements over the state-of-the-art in terms of both accuracy and computational complexity. Segmentation performance is improved through convexity constrained distance utilization, whereas computational efficiency is achieved by replacing complete region processing by a boundary adaptation technique. Starting from the uniformly distributed, rectangular (cubical) equal size (volume) superpixels (supervoxels), ...
Open problems in CEM: A new look at the stability analysis of the finite-difference time-domain method Ergül, Özgür Salih; Özakın, M. Burak (2014-01-01) The stability analysis of a numerical time-domain method plays a crucial role in well understanding the numerical behavior of the algorithm. The stability analysis should therefore be investigated in all senses. In this work, a new look at the stability analysis of the Finite-Difference Time-Domain Method is given. A novel link is constructed between the numerical-dispersion analysis and the stability analysis by using the sampled values of the unit space and time steps. Unification of these two analyses th...

Citation Formats

O. K. Alkan and P. Karagöz, “CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction,” presented at the 32nd IEEE International Conference on Data Engineering (ICDE), Helsinki, FINLAND, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55819.