Results 41 to 50 of about 1,634,075 (173)
The rapid expansion of digital teaching-evaluation systems has created opportunities to improve educational decision-making through interpretable data-mining techniques.
Xiaoyan Zhu
doaj +1 more source
Perbaikan Algoritma Charm Untuk Penggalian Frequent Closed Itemsets [PDF]
Penggalian frequent closed itemsets merupakan salah satu bagian penting dari penggalian kaidah asosiasi (association rule) karena dapat secara unik menentukan himpunan semua frequent itemsets dan supportnya.
Mardiyanto, Mardiyanto
core
Claim: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data
Recently, frequent itemsets mining over data streams attracted much attention. However, mining closed itemsets from data stream has not been well addressed.
SONG, Guojie +12 more
core +1 more source
arules - A Computational Environment for Mining Association Rules and Frequent Item Sets [PDF]
Mining frequent itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases.
Bettina Grün +2 more
core
Deriving Frequent Itemsets from Lossless Condensed Representation
In data mining, major research topic is frequent itemset mining (FIM). Frequent Itemsets (FIs) usually generating a large amount of Itemsets from database it causing from high memory and long execution time usage.
A. Subashini, M. Karthikeyan
core +1 more source
Catch the Moment: Maintaining Closed Frequent Itemsets
This paper considers the problem of mining closed frequent itemsets over a data stream sliding window using limited memory space. We design a synopsis data structure to monitor transactions in the sliding window so that we can output the current closed
Philip S. Yu +4 more
core
Mining Frequent Closed Itemsets with the Frequent Pattern List
The mining of the complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of frequent closed itemsets (FCIs), which results in a much smaller number of itemsets.
Ching-chi Hsu +2 more
core
Size of random Galois lattices and number of closed frequent itemsets [PDF]
Given a sample of binary random vectors with i.i.d. Bernoulli(p) components, that is equal to 1 (resp. 0) with probability p (resp. 1−p), we first establish a formula for the mean of the size of the random Galois lattice built from this sample, and a ...
Lévy, Gérard, Emilion, Richard
core +1 more source
DCI Closed: a fast and memory efficient algorithm to mine frequent closed itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting and discarding duplicate closed itemsets, without the need of keeping in ...
Lucchese C, Perego R, Orlando S
core
Mining Generalized Closed Frequent Itemsets of Generalized Association Rules
. In the area of knowledge discovery in databases, the generalized association rule mining is an extension from the traditional association rule mining by given a database and taxonomy over the items in database. More initiative and informative knowledge
core

