Keywords: مؤسسه مکرر; Frequent Itemset; Sampling; Data Mining; Heuristic Rule
مقالات ISI مؤسسه مکرر (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: مؤسسه مکرر; Data mining; Distributed association rule mining systems; Frequent itemset; Database partitioning; Mobile agents
Keywords: مؤسسه مکرر; Transactional data; Association rules; Frequent itemset; Visualization; Tree-like structures; Market basket analysis;
Keywords: مؤسسه مکرر; Closed itemset; Generator; Association rule; Frequent itemset; Data mining
Keywords: مؤسسه مکرر; Stream; Frequent itemset; Data mining; Association rules; Time-sensitive;
Performance optimization of MapReduce-based Apriori algorithm on Hadoop cluster
Keywords: مؤسسه مکرر; Algorithms; Data mining; Big data; Frequent itemset; Apriori; Hadoop; MapReduce;
Semi-supervised learning using frequent itemset and ensemble learning for SMS classification
Keywords: مؤسسه مکرر; Short Message Service (SMS); Ham; Spam; Frequent itemset; Ensemble learning; Semi-supervised classification;
CP-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams
Keywords: مؤسسه مکرر; Data mining; Frequent itemset; Frequent itemset compression; Data stream; Stream data mining
An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices
Keywords: مؤسسه مکرر; Data mining; Association rules; Frequent itemset; Closed itemset; Minimal rules; Closed itemset lattice
Mining top-k regular-frequent itemsets using database partitioning and support estimation
Keywords: مؤسسه مکرر; Data mining; Association rule; Frequent itemset; Top-k itemset mining; Regular-frequent itemset
Mining frequent itemsets in data streams using the weighted sliding window model
Keywords: مؤسسه مکرر; Data mining; Data stream; Weighted sliding window model; Association rule; Frequent itemset
Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach
Keywords: مؤسسه مکرر; Data mining; Data stream; Frequent itemset; Approximation; Combinatorics
Size of random Galois lattices and number of closed frequent itemsets
Keywords: مؤسسه مکرر; Association rule; Bernoulli distribution; Classification; Complexity; Data mining; Frequent itemset; Galois lattice; Winning coalition
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
Keywords: مؤسسه مکرر; Data mining; Frequent itemset; Association rule; Concise representation; Complementary occurrence; Disjunctive support; Disjunctive search space; Closure operator; Equivalence class; Disjunctive closed itemset; Essential itemset; Generalized association r
Index-BitTableFI: An improved algorithm for mining frequent itemsets
Keywords: مؤسسه مکرر; Data mining; Association rule; Frequent itemset; BitTable; Index array; Subsume index
TOPSIS: Finding Top-K significant N-itemsets in sliding windows adaptively
Keywords: مؤسسه مکرر; Data mining; FP-tree; Data stream; Sliding window; Frequent itemset
Discovering frequent itemsets by support approximation and itemset clustering
Keywords: مؤسسه مکرر; Support approximation; Clustering; Data mining; Combinatorial approximation; Frequent itemset
Incremental mining of generator representation using border sets
Keywords: مؤسسه مکرر; Frequent itemset; Frequent generator; Border set; Incremental mining