Results 251 to 260 of about 118,288 (291)
Some of the next articles are maybe not open access.

Pruning strategies for mining high utility itemsets

Expert Systems with Applications, 2015
Presents an efficient high utility mining method.Employs novel pruning strategies to limit the search space of utility mining.Compares the proposed method against a state-of-the-art utility mining method.Experimentally evaluates the system on eight real and synthetic benchmark datasets.Empirical results are found to be quite promising, especially for ...
openaire   +1 more source

Unsupervised Synaptic Pruning Strategies for Restricted Boltzmann Machines

2018 IEEE Biomedical Circuits and Systems Conference (BioCAS), 2018
While unsupervised generative neural networks are attractive choices for adoption in always-on continuous-time smart sensory systems, they typically impose heavy memory requirements on the underlying computational fabric. Recent literature on binarized neural networks has not yet been extended to unsupervised generative networks and alternate ...
Surabhi Kalyan   +4 more
openaire   +1 more source

Mining Association Rules Based on Deep Pruning Strategies

Wireless Personal Communications, 2017
Today mobile network and various smart devices flourish rapidly. Data collected from the mobile devices and network can bring us huge opportunities to understand some significant characteristics of the users which traditional data cannot. Association rules mining is an extremely important topic in data mining that can make the utmost value of massive ...
Lei Li   +4 more
openaire   +1 more source

High-Utility Itemset Mining with Effective Pruning Strategies

ACM Transactions on Knowledge Discovery from Data, 2019
High-utility itemset mining is a popular data mining problem that considers utility factors, such as quantity and unit profit of items besides frequency measure from the transactional database. It helps to find the most valuable and profitable products/items that are difficult to track by using only the frequent itemsets.
Jimmy Ming-Tai Wu   +2 more
openaire   +1 more source

The Biases of Decision Tree Pruning Strategies

1999
Post pruning of decision trees has been a successful approach in many real-world experiments, but over all possible concepts it does not bring any inherent improvement to an algorithm's performance. This work explores how a PAC-proven decision tree learning algorithm fares in comparison with two variants of the normal top-down induction of decision ...
openaire   +1 more source

Wielding Occam's Razor: Pruning Strategies for Economic Loss

Oxford Journal of Legal Studies, 2006
The English Court of Appeal is currently faced with three analytically distinct approaches to the question of when one party owes another a duty of care in respect of her economic interests, all of which bear the authority of the House of Lords. Unable to choose between them, it has recently adopted a fourth approach combining which combines them, in ...
openaire   +2 more sources

SUB-OBJECT PRUNING ALGORITHM: A NOVEL PRUNING STRATEGY FOR DISTANCE DETERMINATION IN COMPLEX DYNAMIC ENVIRONMENTS

Transactions of the Canadian Society for Mechanical Engineering, 2005
Computing the minimum distance between objects is known to be a complex problem particularly in compact dynamic environments. Determining the minimum distance between complex objects has been solved by many different authors. Some methods rely on computational geometry techniques, while others rely on numerical optimization techniques. Most algorithms
Raja Uppuluri, Juan A. Carretero
openaire   +1 more source

Structure Characteristic-Aware Pruning Strategy for Convolutional Neural Networks

2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS), 2019
Convolutional Neural Networks have received considerable attention over the past few years, and they are widely used in various fields. However, the computational complexity and excessive storage space caused by over-parameterized of these networks are also being serious.
Peixuan Zuo   +7 more
openaire   +1 more source

An empirical comparison of pruning strategies in game trees

IEEE Transactions on Systems, Man, and Cybernetics, 1985
Size pruning strategies on uniform and nonuniform game trees of 24 different sizes, each being assigned leaf-node static values under four different schemes, are compared. The performance of these strategies is compared on the basis of nodes created, node visits, and CPU time.
Agata Muszycka, Rajjan Shinghal
openaire   +1 more source

Pruning Strategies for Partial Search in Spoken Term Detection

Proceedings of the Eighth International Symposium on Information and Communication Technology, 2017
In this paper, we propose a partial search approach for subword-based keyword search (KWS) systems. The proposed approach addresses the problem of high miss rate in the conventional full sequence matching approach by retaining detections that only contain some partial sequences.
Van Tung Pham   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy