Results 11 to 20 of about 118,288 (291)
Biomedical texts are relatively obscure in describing relations between specialized entities, and the automatic extraction of drug–drug or drug–disease relations from massive biomedical texts presents a challenge faced by many researchers.
Wanli Yang +4 more
doaj +1 more source
An Efficient Approach for Mining Reliable High Utility Patterns
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
IntroductionInsect pests from the family Papilionidae (IPPs) are a seasonal threat to citrus orchards, causing damage to young leaves, affecting canopy formation and fruiting. Existing pest detection models used by orchard plant protection equipment lack
Lijia Xu +17 more
doaj +1 more source
A Method for Closed Frequent Subgraph Mining in a Single Large Graph
Mining frequent subgraphs is an interesting and important problem in the graph mining field, in that mining frequent subgraphs from a single large graph has been strongly developed, and has recently attracted many researchers.
Lam B. Q. Nguyen +5 more
doaj +1 more source
An efficient colossal closed itemset mining algorithm for a dataset with high dimensionality
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
Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems [PDF]
We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for sphere decoder (SD), which can also be applied to any tree search algorithms. Our
Cui, Tao +2 more
core +1 more source
Two-Stage Bagging Pruning for Reducing the Ensemble Size and Improving the Classification Performance [PDF]
Ensemble methods, such as the traditional bagging algorithm, can usually improve the performance of a single classifier. However, they usually require large storage space as well as relatively time-consuming predictions. Many approaches were developed to
Chen, Bi +4 more
core +2 more sources
TUB-HAUPM: Tighter Upper Bound for Mining High Average-Utility Patterns
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
Variable Samples Learning Least Square Support Vector Machine Algorithm [PDF]
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
A Recursive Ensemble Learning Approach With Noisy Labels or Unlabeled Data
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

