Skip to main navigation
Skip to search
Skip to main content
Penn State Home
Help & FAQ
Home
Researchers
Research output
Research units
Equipment
Grants & Projects
Prizes
Activities
Search by expertise, name or affiliation
Data access skipping for recursive partitioning methods
Orhan Kislal,
Mahmut T. Kandemir
Computer Science and Engineering
Institute for Computational and Data Sciences (ICDS)
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Data access skipping for recursive partitioning methods'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Performance Improvement
100%
Data Access
100%
Skipping
100%
Memory Performance
66%
Accuracy Loss
66%
Caching
33%
Learning Process
33%
Model Accuracy
33%
Aggressiveness
33%
Replacement Policy
33%
Small Loss
33%
Multiple Models
33%
Modern Application
33%
Recursive Partitioning
33%
Random Forest Machine Learning
33%
Accuracy Requirements
33%
Model Tree
33%
Dataset Size
33%
Data Mining Applications
33%
Multi-level Cache
33%
Decision Tree Learning
33%
Decision Tree Forest
33%
Computer Science
Data Access
100%
Partitioning Method
100%
Performance Improvement
66%
Memory Performance
66%
Decision Tree
66%
Random Decision Forest
33%
Learning Process
33%
Replacement Policy
33%
Data Mining Application
33%
Multilevel Cache Hierarchy
33%
Accuracy Requirement
33%