English
Related papers

Related papers: A one-phase tree-based algorithm for mining high-u…

200 papers

In the recent decade companies started collecting of large amount of data. Without a proper analyse, the data are usually useless. The field of analysing the data is called data mining. Unfortunately, the amount of data is quite large: the…

Databases · Computer Science 2021-08-12 Robert Kessl

High utility sequential pattern mining (HUSPM) aims to mine all patterns that yield a high utility (profit) in a sequence dataset. HUSPM is useful for several applications such as market basket analysis, marketing, and website clickstream…

Databases · Computer Science 2023-02-23 Tai Dinh , Philippe Fournier-Viger , Huynh Van Hong

High-utility sequential pattern mining (HUSPM) has recently emerged as a focus of intense research interest. The main task of HUSPM is to find all subsequences, within a quantitative sequential database, that have high utility with respect…

Databases · Computer Science 2020-11-30 Chunkai Zhang , Zilin Du , Wensheng Gan , Philip S. Yu

Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically. However, most algorithms for mining frequent itemsets assume that the main memory is large enough for the data…

Databases · Computer Science 2016-08-16 Gösta Grahne , Jianfei Zhu

Sequence data, e.g., complex event sequence, is more commonly seen than other types of data (e.g., transaction data) in real-world applications. For the mining task from sequence data, several problems have been formulated, such as…

Databases · Computer Science 2019-12-30 Wensheng Gan , Jerry Chun-Wei Lin , Han-Chieh Chao , Philip S. Yu

Utility-driven mining is an important task in data science and has many applications in real life. High utility sequential pattern mining (HUSPM) is one kind of utility-driven mining. HUSPM aims to discover all sequential patterns with high…

Databases · Computer Science 2021-12-01 Gengsen Huang , Wensheng Gan , Jian Weng , Philip S. Yu

Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need both. For example, online games, socio-mobile apps, and…

Databases · Computer Science 2012-05-31 Benjamin Sowell , Wojciech Golab , Mehul A. Shah

The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that compress the data efficiently. As a compression technique we…

Data Structures and Algorithms · Computer Science 2019-02-08 Nikolaj Tatti , Jilles Vreeken

The need to analyze information from streams arises in a variety of applications. One of its fundamental research directions is to mine sequential patterns over data streams. Current studies mine series of items based on the presence of the…

Databases · Computer Science 2022-04-12 Thomas Guyet , Wenbin Zhang , Albert Bifet

The increase and rapid growth of data produced by scientific instruments, the Internet of Things (IoT), and social media is causing data transfer performance and resource consumption to garner much attention in the research community. The…

Performance · Computer Science 2023-09-29 Hasibul Jamil , Lavone Rodolph , Jacob Goldverg , Tevfik Kosar

Modern Internet of Things (IoT) applications generate massive amounts of data, much of it in the form of objects/items of readings, events, and log entries. Specifically, most of the objects in these IoT data contain rich embedded…

Databases · Computer Science 2021-04-01 Wensheng Gan , Jerry Chun-Wei Lin , Han-Chieh Chao , Athanasios V. Vasilakos , Philip S. Yu

Large-scale industrial recommender systems are usually confronted with computational problems due to the enormous corpus size. To retrieve and recommend the most relevant items to users under response time limits, resorting to an efficient…

Information Retrieval · Computer Science 2019-11-21 Han Zhu , Daqing Chang , Ziru Xu , Pengye Zhang , Xiang Li , Jie He , Han Li , Jian Xu , Kun Gai

In concurrent data structures, the efficiency of set operations can vary significantly depending on the workload characteristics. Numerous concurrent set implementations are optimized and fine-tuned to excel in scenarios characterized by…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-29 Daniel Manor , Mor Perry , Moshe Sulamy

Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The problem of developing models and algorithms for multilevel…

Databases · Computer Science 2012-09-28 Pratima Gautam , Rahul Shukla

A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior of frequent patterns in a transaction database. To discover…

Databases · Computer Science 2014-10-09 B. Kiran Kumar , A. Bhaskar

Several multi-pass algorithms have been proposed for Association Rule Mining from static repositories. However, such algorithms are incapable of online processing of transaction streams. In this paper we introduce an efficient single-pass…

Databases · Computer Science 2010-04-28 M . V. Vijaya Saradhi , B. R. Sastry , P. Satish

New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for…

Databases · Computer Science 2010-08-17 Eveline Hoekx , Jan Van den Bussche

Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis, with the most recent interestingness models exhibiting state of the…

Machine Learning · Statistics 2016-11-14 Jaroslav Fowkes , Charles Sutton

With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The aim of auto-administrative systems is to administrate and…

Databases · Computer Science 2008-09-17 Kamel Aouiche , Jérôme Darmont , Le Gruenwald

Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining. Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequent itemsets. When the length of…

Databases · Computer Science 2011-09-13 M. Rajalakshmi , Dr. T. Purusothaman , Dr. R. Nedunchezhian