Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
greedy search complexity
biblio
A fast information-theoretic approximation of joint mutual information feature selection
Submitted by grigby1 on Thu, 12/28/2017 - 1:37pm
polynomial time
JMI maximization
JMI scales
joint mutual information feature selection
joint mutual information maximization
Metrics
minimum features subset
Mutual information
pattern classification
Policy-Governed Secure Collaboration
information theory
pubcrawl
Redundancy
Resiliency
Scalability
Science of Security
search problems
UCI datasets
unified framework
Upper bound
fast information-theoretic approximation
classification
collaboration
Complexity theory
composability
computational complexity
data analysis
data reduction
dimensionality reduction
Entropy
approximation theory
Feature Selection
feature size
filtering theory
greedy algorithms
greedy forward search
greedy search complexity
high dimensional datasets
Human behavior
Human Factors
