Missing Value Imputation Method for Multiclass Matrix Data Based on Closed Itemset [PDF]
Handling missing values in matrix data is an important step in data analysis. To date, many methods to estimate missing values based on data pattern similarity have been proposed. Most previously proposed methods perform missing value imputation based on
Mayu Tada +2 more
doaj +2 more sources
Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules [PDF]
In business, managers may use the association information among products to define promotion and competitive strategies. The mining of high-utility association rules (HARs) from high-utility itemsets enables users to select their own weights for rules ...
Thang Mai +4 more
doaj +2 more sources
Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data [PDF]
During the last decade various algorithms have been developed and proposed for discovering overlapping clusters in high-dimensional data. The two most prominent application fields in this research, proposed independently, are frequent itemset mining ...
András Király +2 more
doaj +2 more sources
Analyzing large gene expression and methylation data profiles using StatBicRM: statistical biclustering-based rule mining. [PDF]
Microarray and beadchip are two most efficient techniques for measuring gene expression and methylation data in bioinformatics. Biclustering deals with the simultaneous clustering of genes and samples.
Ujjwal Maulik +3 more
doaj +2 more sources
Closed High Utility Pattern Mining over Data Stream Based on Projection in the Window
A fast and effective algorithm EFIM_Closed_DS was proposed to mine closed and high utility itemsets in the data stream environment. The algorithm is based on the projection technology in the window, and the database projection technology and transaction ...
Muhang LI +4 more
doaj +1 more source
Graded Galois Lattices and Closed Itemsets [PDF]
15 pages, 2 figures, 1 table, derived from the Ph.D ...
Reza Sotoudeh +2 more
openaire +2 more sources
Proposed Algorithm for Extracting Association Rule Depend on Closed Frequent Itemset (EACFI) [PDF]
Association rules are important one of data mining activities. All algorithms of association rule mining consist of finding frequency of itemsets, which satisfy a minimum support threshold, and then compute confidence percentage for each k-itemsets to ...
Emad k. Jbbar, Yaser Munther
doaj +1 more source
High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
Documents clustering based on frequent itemsets can be regarded a new method of documents clustering which is aimed to overcome curse of dimensionality of items produced by documents being clustered.
Gede Aditra Pradnyana, Arif Djunaidy
doaj +1 more source
Concept Lattice Method for Spatial Association Discovery in the Urban Service Industry
A relative lag in research methods, technical means and research paradigms has restricted the rapid development of geography and urban computing. Hence, there is a certain gap between urban data and industry applications.
Weihua Liao, Zhiheng Zhang, Weiguo Jiang
doaj +1 more source
Efficient Associate Rules Mining Based on Topology for Items of Transactional Data
A challenge in association rules’ mining is effectively reducing the time and space complexity in association rules mining with predefined minimum support and confidence thresholds from huge transaction databases.
Bo Li, Zheng Pei, Chao Zhang, Fei Hao
doaj +1 more source

