2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDMLSP-22.5
Paper Title OPTIMUM FEATURE ORDERING FOR DYNAMIC INSTANCE–WISE JOINT FEATURE SELECTION AND CLASSIFICATION
Authors Yasitha Warahena Liyanage, Daphney-Stavroula Zois, University at Albany, State University of New York, United States
SessionMLSP-22: Sequential Learning
LocationGather.Town
Session Time:Wednesday, 09 June, 15:30 - 16:15
Presentation Time:Wednesday, 09 June, 15:30 - 16:15
Presentation Poster
Topic Machine Learning for Signal Processing: [MLR-SLER] Sequential learning; sequential decision methods
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract We introduce a supervised machine learning framework to perform joint feature selection and classification individually for each data instance during testing. In contrast to our prior work, we decide both the order and the number of features for each data instance. Specifically, our proposed solution dynamically selects the feature to review at each stage based on the already observed features and stops the selection process to make a prediction once it determines no classification improvement can be achieved. To gain insights, we analyze the properties of the proposed solution. Based on these properties, we propose a fast algorithm and demonstrate its effectiveness compared to the state-of-the-art using 4 publicly available datasets.