Amanote Research

Amanote Research

    RegisterSign In

Mining With Constraints by Pruning and Avoiding Ineffectual Processing

Lecture Notes in Computer Science - Germany
doi 10.1007/11589990_129
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2005

Authors
Mohammad El-HajjOsmar R. Zaïane
Publisher

Springer Berlin Heidelberg


Related search

Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space

International Journal of Advanced Computer Science and Applications
Computer Science
2020English

Mining Frequent Itemsets With Convertible Constraints

English

Effective Pruning Strategies for Sequential Pattern Mining

2008English

Pruning Based Service Selection Approach Under QoS and Temporal Constraints

2014English

Closed Frequent Itemset Mining With Arbitrary Side Constraints

2018English

Full Perfect Extension Pruning for Frequent Graph Mining

2006English

Mining Sequential Patterns for Interval Based Events by Applying Multiple Constraints

International Journal on Computational Science & Applications
2014English

Image Mining Using Directional Spatial Constraints

IEEE Geoscience and Remote Sensing Letters
Electronic EngineeringElectricalEngineering GeologyGeotechnical Engineering
2010English

A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy