Results 21 to 30 of about 31,077 (302)
An efficient colossal closed itemset mining algorithm for a dataset with high dimensionality
Journal of King Saud University: Computer and Information Sciences, 2022 The greater interest of research in the field of bioinformatics and the ample amount of available data across the different domains paved the way for the generation of the dataset with high dimensionality.
Manjunath K. Vanahalli, Nagamma Patil
doaj +1 more source
An Efficient Tree-Based Algorithm for Mining High Average-Utility Itemset
IEEE Access, 2019 High-utility itemset mining (HUIM), which is an extension of well-known frequent itemset mining (FIM), has become a key topic in recent years. HUIM aims to find a complete set of itemsets having high utilities in a given dataset.
Irfan Yildirim, Mete Celik
doaj +1 more source
, 2023 Recently Text-to-Video (T2V) synthesis has undergone a breakthrough by training transformers or diffusion models on large-scale datasets. Nevertheless, inferring such large models incurs huge costs.
Su, Sitong +3 more
core +1 more source
Variable Samples Learning Least Square Support Vector Machine Algorithm [PDF]
Jisuanji gongcheng, 2019 In order to increase the sparseness of the solution of Least Squares Support Vector Machine (LS-SVM) algorithm and improve its operation efficiency,a variable samples learning LS-SVM algorithm is proposed.Some samples are randomly selected from the ...
JIA Erkenbieke,YUAN Jie
doaj +1 more source
Index Maintenance Strategy and Cost Model for Extended Cluster Pruning [PDF]
, 2019 With today’s dynamic multimedia collections, maintenance of high-dimensional indexes is an important, yet understudied topic. Extended Cluster Pruning (eCP) is a highly-scalable approximate indexing approach based on clustering, that is targeted at ...
Jónsson, Björn Thór +5 more
core +1 more source
EHAUPM: Efficient High Average-Utility Pattern Mining With Tighter Upper Bounds
IEEE Access, 2017 High-utility itemset mining (HUIM) has become a popular data mining task, as it can reveal patterns that have a high-utility, contrarily to frequent pattern mining, which focuses on discovering frequent patterns.
Jerry Chun-Wei Lin +3 more
doaj +1 more source
IEEE Access, 2018 The A-star algorithm is an efficient classical algorithm for solving the shortest path problem. The efficiency of the algorithm depends on the evaluation function, which is used to estimate the heuristic value of the shortest path from the current vertex
Yan Li +5 more
doaj +1 more source
An Efficient Adjoint Pattern Mining Algorithm for Moving Object [PDF]
Jisuanji gongcheng, 2020 Mining adjoint patterns of moving objects is finding the set of objects with similar trajectories and time from a spatio-temporal perspective,which is widely used in user behavior analysis based on geographical location.However,the existing similarity ...
WANG Qitong, WANG Peng, ZHAO Yuliang, WANG Wei
doaj +1 more source
Bonsai trees in your head: how the pavlovian system sculpts goal-directed choices by pruning decision trees. [PDF]
PLoS Computational Biology, 2012 When planning a series of actions, it is usually infeasible to consider all potential future sequences; instead, one must prune the decision tree. Provably optimal pruning is, however, still computationally ruinous and the specific approximations humans ...
Quentin J M Huys +5 more
doaj +1 more source
TUB-HAUPM: Tighter Upper Bound for Mining High Average-Utility Patterns
IEEE Access, 2018 High-utility itemset mining (HUIM) has been gaining popularity in the field of data mining. Frequent itemset mining used to be the main tool to reveal high-frequency patterns but failed to consider the concept of profit.
Jimmy Ming-Tai Wu +3 more
doaj +1 more source