NDLI: Fast randomized algorithm with restart strategy for minimal test cost feature selection

Content Provider	Springer Nature Link
Author	Li, Jingkuan Zhao, Hong Zhu, William
Copyright Year	2014
Abstract	Feature selection is an important problem in data mining and machine learning. Cost-sensitive feature selection over the past 10 years has seen increasingly rapid advances. Recently, a fast randomized algorithm was designed for this problem. Unfortunately, the performance of algorithms is heavily dependent on the size of datasets. In this paper, we propose an optimal randomized algorithm which adopts the restart strategy in the fast randomized algorithm for minimal test cost feature selection. The restart strategy can effectively address this limitation which depends on the size of datasets. There are two major stages in our algorithm: the addition stage and the deletion stage. In the addition stage, we obtain a subset to represent the original attributes. In this stage, the randomized mechanism helps us to select a subset rapidly. In the deletion stage, we remove redundant attributes by using the restart strategy to further improve the efficiency. Compared with the fast randomized algorithm, the effective of our algorithm increases sharply in the same runtime. Meanwhile, our algorithm reduces about a quarter of the runtime under the same number of experiments.
Starting Page	435
Ending Page	442
Page Count	8
File Format	PDF
ISSN	18688071
Journal	International Journal of Machine Learning and Cybernetics
Volume Number	6
Issue Number	3
e-ISSN	1868808X
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2014-05-14
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Feature selection Restart strategy Test cost Time constraint Computational Intelligence Artificial Intelligence (incl. Robotics) Control, Robotics, Mechatronics Statistical Physics, Dynamical Systems and Complexity Systems Biology Pattern Recognition
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An exponent weighted algorithm for minimal cost feature selection

Comparative analysis on margin based feature selection algorithms

An improved artificial bee colony algorithm for minimal time cost reduction

Sparse group LASSO based uncertain feature selection

Minimizing data consumption with sequential online feature selection

A variational Bayesian framework for group feature selection

A bilingual word alignment algorithm of Vietnamese-Chinese based on feature constraint

An efficient gene selection technique for cancer recognition based on neighborhood mutual information

A fast template matching-based algorithm for railway bolts detection

Fast randomized algorithm with restart strategy for minimal test cost feature selection

Similar Documents

An exponent weighted algorithm for minimal cost feature selection

Comparative analysis on margin based feature selection algorithms

An improved artificial bee colony algorithm for minimal time cost reduction

Sparse group LASSO based uncertain feature selection

Minimizing data consumption with sequential online feature selection

A variational Bayesian framework for group feature selection

A bilingual word alignment algorithm of Vietnamese-Chinese based on feature constraint

An efficient gene selection technique for cancer recognition based on neighborhood mutual information

A fast template matching-based algorithm for railway bolts detection

Fast randomized algorithm with restart strategy for minimal test cost feature selection