SPRINT

swMATH11760MaRDI QIDQ23699FDOQ23699

Author name not available (Why is that?)

Cited In (27)

• Title not available (Why is that?)
• A new classification method to overcome over-branching
• A review of data mining applications in crime
• A framework for measuring differences in data characteristics
• XRules: an effective algorithm for structural classification of XML data
• Building multi-way decision trees with numerical attributes
• Learning ELM-tree from big data based on uncertainty reduction
• Pipelining of Fuzzy ARTMAP without matchtracking: Correctness, performance bound, and Beowulf evaluation
• Parallelization of fuzzy ARTMAP to improve its convergence speed: the network partitioning approach and the data partitioning approach
• Moving towards efficient decision tree construction
• PUBLIC: A decision tree classifier that integrates building and pruning
• A reduction algorithm meeting users' requirements.
• On Scalability of Rough Set Methods
• Knowledge discovery and measures of interest
• Widening: using parallel resources to improve model quality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Post-pruning in decision tree induction using multiple performance measures
• Method for parallel construction of a committee of decision tree for processing the electroencephalography signals
• Title not available (Why is that?)
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Online learning of the cause-and-effect knowledge of a manufacturing process
• Visualization and analysis of clickstream data of online stores for understanding web merchandising
• A survey on concept drift adaptation
• Title not available (Why is that?)
• An efficient algorithm for finding dense regions for mining quantitative association rules

This page was built for software: SPRINT