The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nowadays, a hot challenge for supermarket chains is to offer personalized services to their customers. Market basket prediction, i.e., supplying the customer a shopping list for the next purchase according to her current needs, is one of these services. Current approaches are not capable of capturing at the same time the different factors influencing the customer's decision process: co-occurrence,...
A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of antimonotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns...
Contrast patterns are itemsets that frequently occur in one dataset while not in another. These patterns have been successfully applied to many data mining domains, such as prediction, classification and clustering. However, none of the previous studies has considered extracting contrast patterns from different types of datasets. In this paper, we introduce a new type of contrast pattern, Conditional...
Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Although a number of relevant approaches have been proposed in recent years, but they incur the problem of producing a large number of candidate itemsets for high utility itemsets. Such a large number of candidate itemsets degrades the mining performance in terms of execution...
Recurring patterns are ubiquitous in large datasets. In various applications, they can gives useful information pertaining to seasonal or temporal associations between items. In the web blog, various recurrent patterns are found which contain useful information. Finding recurring patterns is a non-trivial task because of main reasons. Each recurring pattern is associated with temporal information...
Association rule mining from the large transactional database is one of the interesting and challenging paradigms in knowledge discovery. An objective measure is a key tool for the measurement of interestingness in between two patterns. Association rules extracted using traditional objective measures may have high dissociation which is by nature opposite of association. Dissociation in between two...
Based on the concept of isomorphism of relations, a relation is turned into a simplicial complex, which is a combinatorial representation of a polyhedron. So frequent itemsets mining is transform turned into geometric traversal problem. By leveraging on geometric structure of simplicial complex, a very fast algorithm for traversal is found; it is based on a geometric concept, called sub-cone construction...
There is an increasing need to quickly understand the contents log data. A wide range of patterns can be computed and provide valuable information: for example existence of repeated sequences of events or periodic behaviors. However patternminingtechniquesoftenproducemanypatternsthathave to be examined one by one, which is time consuming for experts. On the other hand, visualization techniques are...
To increase the learning effectiveness and willingness of students became the most important issue for the Universities in Taiwan. Therefore, we must find the important factors of the learning effectiveness to improve the learn willingness of students. However, it is not easy to measure the learning effectiveness because the subjective judgment of evaluators and the attributes of factors are always...
Frequent itemset mining is one of the most common of data mining tasks. In its simplest form, one is given a table of data in which the columns represent attributes and each row specifies a value for each attribute, each attribute-value pair being referred to as an item. The task is to find sets of these items that occur frequently in the data, where frequency is specified as a minimum occurrence...
Data mining involves discovering interesting patterns from large dataset to maximize the profit of the future business. Association rule mining is the main area in the field of data mining exploration with wide range of applications. Determining the frequent item-sets in large dataset is the core task of association rule mining and it is frequently used by business decision makers to improve their...
Klout, a famous App, could measure people's social network influence power. Klout score is measured according to the data from past 90 days and an individual who has high Klout score is thought as having high social influence power. Lots of businesses or organizations like to hire high Klout score people to help them to diffuse their brand images. However, Klout score cannot tell us who has high influence...
In this paper, we propose the WUN-set (Weighted Utility Nodeset) structure, an extension of the Nodeset structure, to solve the problem of mining frequent weighted utility itemsets from a quantitative database. Firstly, some theorems are developed to compute quickly the weighted utility support of an itemset. An algorithm is then proposed for the fast mining frequent weighted utility itemsets. The...
Sohrabi and Barforoush proposed the BVBUC (Bitwise vertical bottom up colossal) algorithm for mining colossal patterns based on a bottom up scheme. It, however, spends more time to check subsets and supersets, because it generates a lot of candidates and consumes more memory usage to store these. In this paper, we propose a new method for mining colossal patterns. Firstly, the CP (Colossal Pattern)-tree...
Understanding customer buying patterns is of great interest to the retail industry. Association rule mining is a common technique for extracting correlations such as people in the South of France buy rosé wine or customers who buy paté also buy salted butter and sour bread. Unfortunately, sifting through a high number of buying patterns is not useful in practice, because of the predominance of popular...
Infrequent itemsets mining is an extremely important mining technique of Association Rule Mining (ARM) with wide applications. It found very helpful in a variety of domains like remedial, biology, banking, retail, market basket analysis, etc. Infrequent itemsets finds the hidden an association among the data items. The rare consolidation of the itemsets can be interesting and more profitable. The...
One of the most common problems in data mining is to find frequent itemsets. There are various algorithms which extract such itemsets from large database based on Minimum Support Threshold (MST). They further generate association rules based on Minimum Confidence Threshold (MCT). These two threshold values are defined by user or organization. Apriori is one of the most popular data mining algorithms...
Data mining is one of the most important steps in knowledge discovery. Apriori algorithm is the most used one in this process. The major drawback with Apriori algorithm is of time and space. It generates numerous uninteresting itemsets which lead to generate various rules which are of completely of no use. The two factors considered for association rules generation are Minimum Support Threshold and...
Weighted item-set mining is used to find the profitable connection between the data. There are two types of items contained in dataset i.e. frequent and infrequent. Infrequent item-sets are nothing but items which are rarely found in database. Mining frequent items in data mining are very helpful for retrieving the related data present in the dataset. Using transactional dataset as an input dataset...
We address the problem of finding local patterns and related local knowledge in an attributed graph. Our approach consists in extending the methodology of frequent closed pattern mining to the case in which the set of objects, in which are to be found the patterns support sets, is the set of vertices of a graph, typically representing a social network. We propose an algorithm to enumerate triples...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.