Results 11 to 20 of about 31,239 (262)
Towards Robust Pruning: An Adaptive Knowledge-Retention Pruning Strategy for Language Models
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023 The pruning objective has recently extended beyond accuracy and sparsity to robustness in language models. Despite this, existing methods struggle to enhance robustness against adversarial attacks when continually increasing model sparsity and require a retraining process.
Jianwei Li 0004 +3 more
openaire +2 more sources
An Efficient Approach for Mining Reliable High Utility Patterns
IEEE Access, 2022 Utility mining is one of the most thriving research topics with a wide range of real-world applications. High utility pattern mining uses a utility function to extract all desired patterns that exceed a minimum utility threshold.
Mohammed A. Fouad +4 more
doaj +1 more source
An Optimal Constrained Pruning Strategy for Decision Trees [PDF]
INFORMS Journal on Computing, 2009 This paper is concerned with the optimal constrained pruning of decision trees. We present a novel 0–1 programming model for pruning the tree to minimize some general penalty function based on the resulting leaf nodes, and show that this model possesses a totally unimodular structure that enables it to be solved as a shortest-path problem on an ...
Hanif D. Sherali +2 more
openaire +3 more sources
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
A Recursive Ensemble Learning Approach With Noisy Labels or Unlabeled Data
IEEE Access, 2019 For many tasks, the successful application of deep learning relies on having large amounts of training data, labeled to a high standard. But much of the data in real-world applications suffer from label noise.
Yuchen Wang +3 more
doaj +1 more source
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
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
TREE CANOPY PRUNING DOES NOT REGULATE BIENNIAL BEARING IN ”ELSTAR” APPLE (Malus domestica Borkh.) [PDF]
Poljoprivreda, 2004 Four alternative pruning strategies (A– 25 generative buds, B– 50 generative buds, C– 75 generative buds and D–100 generative buds per tree) for Elstar apple cultivar and their possible impact on improvement in productivity were examined in 1999 and 2000.
Nikola Pavičić +3 more
doaj
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
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