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.
Frequent closed itemsets mining has become an important alternative of association rule mining recently. CloSET+ is an efficient algorithm to find frequent closed itemsets without candidate generation. However, CloSET+ must scan database two times. In order to enhance the efficiency of CloSET+ algorithms and reduce the I/O cost of database scanning in frequent closed itemsets mining, propose a novel...
The I/O cost of database scanning has been a bottleneck problem in data mining. Many algorithms proposed recently are based on FP-tree. These algorithms include all frequent itemsets mining, closed frequent itemsets mining and top-k closed frequent itemsets mining. However, creating FP-tree from database must scan database two times. In order to enhance the efficiency of FP-tree based algorithms,...
Mining association rules from large databases is an important problem in data mining. FP-growth is a powerful algorithm to mine frequent patterns and it is non-candidate generation algorithm using a special structure FP-tree. In order to enhance the efficiency of FP-grown algorithm, propose a novel parallel algorithm PFPTC to create sub FP-trees concurrently and a FP-tree merging algorithm called...
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.