Results 71 to 80 of about 338,799 (197)
An Efficient Approach for Mining High Average-Utility Itemsets in Incremental Database
Traditional high-utility itemset (HUI) mining methods tend to overestimate utility for long itemsets, leading to biased results. High average-utility itemset (HAUI) mining addresses this problem by normalizing utility with itemset length.
Ye-In Chang +2 more
doaj +1 more source
Against the backdrop of global climate change, extreme rainfall events are becoming increasingly frequent, leading to a continuous worsening of urban flooding and posing a serious threat to the operational safety of underground rail transit systems.
Aizhong Luo +5 more
doaj +1 more source
A Framework for High-Accuracy Privacy-Preserving Mining
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of data records have been proposed recently.
Agrawal, Shipra, Haritsa, Jayant R.
core +3 more sources
The growing expanse of e-commerce and the widespread availability of online databases raise many fears regarding loss of privacy and many statistical challenges.
Fienberg, Stephen E.
core +3 more sources
RESEARCH ISSUES CONCERNING ALGORITHMS USED FOR OPTIMIZING THE DATA MINING PROCESS [PDF]
In this paper, we depict some of the most widely used data mining algorithms that have an overwhelming utility and influence in the research community. A data mining algorithm can be regarded as a tool that creates a data mining model.
Alexandru PƮrjan, Ion Lungu
core
Adaptive Submodular Influence Maximization with Myopic Feedback
This paper examines the problem of adaptive influence maximization in social networks. As adaptive decision making is a time-critical task, a realistic feedback model has been considered, called myopic.
Salha, Guillaume +2 more
core +2 more sources
iFUM Improved Fast Utility Mining
main goals of Association Rule Mining (ARM) are to find all frequent itemsets and to build rules based of frequent itemsets. But a frequent itemset only reproduces the statistical correlation between items, and it does not reflect the semantic importance of the items.
S. Shankar +2 more
openaire +1 more source
Parallel Mining Algorithm for the Enumeration Space of Closed High Utility Itemsets
To address the issues of result redundancy and time overhead in high-dimensional data environments, a closed high utility itemset mining algorithm, SpCHUIM (Closed High Utility Itemsets Mining on Spark), is proposed.
LI Chengyan, SUN Anqi, LIU Songlin
doaj +1 more source
Synthesizing High-Utility Patterns from Different Data Sources
In large organizations, it is often required to collect data from the different geographic branches spread over different locations. Extensive amounts of data may be gathered at the centralized location in order to generate interesting patterns via mono ...
Abhinav Muley, Manish Gudadhe
doaj +1 more source
Learning Semantic Correspondences in Technical Documentation
We consider the problem of translating high-level textual descriptions to formal representations in technical documentation as part of an effort to model the meaning of such documentation.
Kuhn, Jonas, Richardson, Kyle
core +1 more source

