Results 81 to 90 of about 801,363 (206)
Interpretable heart disease risk prediction via FCA-constrained logistic regression
Health Informatics JournalObjective To develop an interpretable and clinically coherent heart disease risk prediction model by integrating Formal Concept Analysis (FCA) with a novel closure-constrained logistic regression that enforces coefficient coherence within FCA-derived ...
Arman Salehi +3 more
doaj +1 more source
Finding Fuzzy Close Frequent Itemsets from Databases
Procedia Computer Science, 2018 Abstract In this paper, we define the problem of fuzzy close frequent itemset mining to discover the rules of the data. A concise tree-based data synoposis named FCTree is built, where the fuzzy itemsets are sorted by their supports. In addition, an algorithm called FCFIMiner is proposed to construct and maintain the FCTree . We conduct superset
Haifeng Li 0006 +3 more
openaire +2 more sources
Claim: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data
, 2007 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
JUTI: Jurnal Ilmiah Teknologi InformasiThis research proposes the optimization of the Frequent Closed High-Utility Itemset Mining (FCHUIM) algorithm for retail transaction datasets using heuristic-based pruning techniques, Observed Support Ratio (OSR), Observed Weighted Lift (OWL), and ...
Kinana Syah Sulanjari, Chastine Fatichah
doaj +1 more source
Mining Frequent Closed Itemsets with the Frequent Pattern List
, 2008 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
Mining Generalized Closed Frequent Itemsets of Generalized Association Rules
, 2020 . 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
Size of random Galois lattices and number of closed frequent itemsets [PDF]
, 2009 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
Closed Itemset Mining: A graph theory perspective
InformaticaData Mining is the field which targets the extraction and the analysis ofusable data from a large database. In this paper, we focus on the most studiedproblems in the field. That is finding closed frequent itemsets. Up to now,various graph theory techniques have been proposed to solve the frequentitemsets problem.
Fatima Zohra Lebbah +2 more
openaire +2 more sources
Mining Frequent Closed Itemsets without Duplicates Generation
, 2004 Closed itemsets are semantically equivalent to frequent itemsets but are orders of magnitude fewer, thus allowing the knowledge extracted from a transactional database to be represented very concisely.
Lucchese C, Perego R, Orlando S
core
Moment: Maintaining closed frequent itemsets over a stream sliding window
, 2004 This paper considers the problem of mining closed frequent itemsets over a 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 frequent ...
Philip S. Yu +3 more
core