Most frequent pattern mining algorithms consider only distinct items in a transaction. However, multiple occurrences of an item in the same shopping basket, such as four cakes and three jugs of milk, can be important in transactional data analysis. How can one mine frequent itemsets efficiently considering multiple occurrences of items? Propose modifications to the well-known algorithms, such as Apriori and FP-growth, to adapt to such a situation.

Most frequent pattern mining algorithms consider only distinct items in a transaction. However, multiple occurrences of an item in the same shopping basket, such as four cakes and three jugs of milk, can be important in transactional data analysis. How can one mine frequent itemsets efficiently considering multiple occurrences of items? Propose modifications to the well-known algorithms, such as Apriori and FP-growth, to adapt to such a situation.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. In multidimensional data analysis, it is interesting to extract pairs of similar cell characteristics associated with substantial changes in measure in a data cube, where cells are considered similar if they are related by roll-up (ie. Ancestors), drill-down (ie. Descendants), or 1-dimensional mutation (ie, siblings) operations. Such an analysis is called cube gradient analysis. Suppose the measure of the cube is average. A user poses a set of probe cells and would like to find their corresponding sets of gradient cells, each of which satisfies a certain gradient threshold. For example, find the set of corresponding gradient cells whose average sale price is greater than 20% of that of the given probe cells. Develop an algorithm than mines the set of constrained gradient cells efficiently in a large data cube.
An Investigation of the Effect of Unbalanced labeled Data on CM and GRFM Algorithms.
Some of your friends have gotten into the burgeoning field of time-series data mining, in which onelooks for patterns in sequences of events that occur over time. Purchases at stock exchanges–what’s beingbought are one source of data with a natural ordering in time. Given a long sequence S of such events, yourfriends want an efficient way to detect certain “patterns” in them–for example, they may want to know ifthe four eventsbuy Yahoo, buy eBay, buy Yahoo, buy Oracleoccur in this sequence S, in order but not necessarily consecutively.They begin with a collection of possible events (e.g., the possible transactions) and a sequence S of n ofthese events. A given event may occur multiple times in S (e.g., Yahoo stock may be bought many times ina single sequence S). We will say that a sequence S′ is a subsequence of S if there is a way to delete certainof the events from S so that the remaining events, in order, are equal to the sequence S′. So, for example, the sequence of the four events…
Question: Suppose we sample m indices from {1, . . . , n} uniformly at random and with repetition. What is theprobability that none of these indices is a correct answer?
Given a dataset X consists of over one million entries of research papers published in business journals and conferences. Among these entries, there are a good number of authors that have coauthor relationships. Propose a method to efficiently mine a set of co-author relationships that are closely related (e.g. often co-authoring papers together.) What pattern evaluation measures would you apply to convincingly uncover close collaboration patterns better than others.
Think of a vector space model and TF*IDF weights in the context of an information retrieval system. A simplistic solution would have to go through every page in the collection to compute the similarity between the query and each item. Give a quick outline of how an inverted index may be used to enhance the IR system's performance.
In Data structures and algorithms,the algorithm technique used in the implementation of Kruskal's solution for the MST is?
Which statement best describes k-means cluster analysis? It is the process of estimating the value of a continuous outcome variable. It is the process of organizing observations into distinct groups based on a measure of similarity or dissimilarity. It is the process of reducing the number of variables to consider in data-mining. It is the process of agglomerating observations into a series of nested groups based on a measure of similarity or dissimilarity.
A main disadvantage of data matching using probabilistic approaches is that they take far longer to run than non-probabilistic approaches. True or false?
Part 2 1. Design an algorithm to test whether there is at least one common element between two sets of numbers. Using appropriate data structures estimate the time complexity of the algorithm. 2. Some diseases cannot be spread unless there is a direct contact with the infected person. Using information of direct contact between every pair (P., P) of n people, describe an algorithm with appropriate data structure to determine person P, could be reached by a sequence of direct contacts stating from P. Estimate the time complexity of the algorithm.
Consider an information retrieval system that relies on a vector space model and TF*IDF weights. A straight-forward system would have to loop through all documents in the collection to compute the similarity between the query and each document. Briefly explain how an inverted index can be used to make the IR system much more efficient.
Q2 solution needed 1. Design an algorithm to test whether there is at least one common element between two sets of numbers. Using appropriate data structures estimate the time complexity of the algorithm. 2. Some diseases cannot be spread unless there is a direct contact with the infected person. Using information of direct contact between every pair (Pi, Pj) of n people, describe an algorithm with appropriate data structure to determine person Pj could be reached by a sequence of direct contacts stating from Pi. Estimate the time complexity of the algorithm.