CRoM and HuspExt Improving efficiency of high utility sequential pattern extraction

Date

2016-05-10

Author

Kirmemis Alkan, Öznur
Karagöz, Pınar

Metadata

Show full item record

Item Usage Stats

154
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/71143
https://www.computer.org/csdl/proceedings-article/icde/2016/07498380/12OmNzwHvpp

DOI

https://doi.org/10.1109/ICDE.2016.7498380

Conference Name

ICDE 2016

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction Alkan, Oznur Kirmemis; Karagöz, Pınar (2016-05-20) 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 ...
Analysis and network representation of hotspots in protein interfaces using minimum cut trees Tunçbağ, Nurcan; Keskin, Ozlem; GÜRSOY, Attila (2010-08-01) We propose a novel approach to analyze and visualize residue contact networks of protein interfaces by graph-based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge-based potentials. The mincut tree, which is constructed from the weighted residue network, simplifies and summarizes the complex structure of the contact network by an efficient and informative representation. This representation offers a comprehensible vie...
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...
WIP - SKOD: A Framework for Situational Knowledge on Demand Palacios, Servio; Solaiman, K.M.A.; Angın, Pelin; Nesen, Alina; Bhargava, Bharat; Collins, Zachary; Sipser, Aaron; Stonebraker, Michael; Macdonald, James (2019-01-01) Extracting relevant patterns from heterogeneous data streams poses significant computational and analytical challenges. Further, identifying such patterns and pushing analogous content to interested parties according to mission needs in real-time is a difficult problem. This paper presents the design of SKOD, a novel Situational Knowledge Query Engine that continuously builds a multi-modal relational knowledge base using SQL queries; SKOD pushes dynamic content to relevant users through triggers based on mo...

Citation Formats

Ö. Kirmemis Alkan and P. Karagöz, “CRoM and HuspExt Improving efficiency of high utility sequential pattern extraction,” presented at the ICDE 2016, 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/71143.