Results 21 to 30 of about 118,288 (291)
Connected operators based on region-tree pruning strategies [PDF]
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002 This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: 1) a region tree representation of the input image is constructed; 2) the simplification is obtained by pruning the tree; and 3) and output image is constructed from the pruned tree. The paper focuses in particular on the
Salembier Clairon, Philippe Jean +1 more
openaire +2 more sources
Multiway pruning for efficient iceberg cubing [PDF]
, 2006 Effective pruning is essential for efficient iceberg cube computation. Previous studies have focused on exclusive pruning: regions of a search space that do not satisfy some condition are excluded from computation.
Chou, P, Zhang, X
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
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
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
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
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
Coarse-Grained Pruning of Neural Network Models Based on Blocky Sparse Structure
Entropy, 2021 Deep neural networks may achieve excellent performance in many research fields. However, many deep neural network models are over-parameterized. The computation of weight matrices often consumes a lot of time, which requires plenty of computing resources.
Lan Huang +5 more
doaj +1 more source
Bagging ensemble selection for regression [PDF]
, 2012 Bagging ensemble selection (BES) is a relatively new ensemble learning strategy. The strategy can be seen as an ensemble of the ensemble selection from libraries of models (ES) strategy. Previous experimental results on binary classification problems have
D.H. Wolpert +10 more
core +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