کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
530264 869755 2015 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Subspace learning for unsupervised feature selection via matrix factorization
ترجمه فارسی عنوان
یادگیری زیرزمینی برای انتخاب ویژگی بدون نظارت از طریق تقسیم ماتریس
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
چکیده انگلیسی


• Propose a new feature selection based on matrix factorization.
• Present a fast convergent algorithm for matrix factorization on certain constraints.
• Incorporate kernel tricks into feature selection problems.
• Construct a unified framework for feature extraction, feature selection and clustering.

Dimensionality reduction is an important and challenging task in machine learning and data mining. Feature selection and feature extraction are two commonly used techniques for decreasing dimensionality of the data and increasing efficiency of learning algorithms. Specifically, feature selection realized in the absence of class labels, namely unsupervised feature selection, is challenging and interesting. In this paper, we propose a new unsupervised feature selection criterion developed from the viewpoint of subspace learning, which is treated as a matrix factorization problem. The advantages of this work are four-fold. First, dwelling on the technique of matrix factorization, a unified framework is established for feature selection, feature extraction and clustering. Second, an iterative update algorithm is provided via matrix factorization, which is an efficient technique to deal with high-dimensional data. Third, an effective method for feature selection with numeric data is put forward, instead of drawing support from the discretization process. Fourth, this new criterion provides a sound foundation for embedding kernel tricks into feature selection. With this regard, an algorithm based on kernel methods is also proposed. The algorithms are compared with four state-of-the-art feature selection methods using six publicly available datasets. Experimental results demonstrate that in terms of clustering results, the proposed two algorithms come with better performance than the others for almost all datasets we experimented with here.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 48, Issue 1, January 2015, Pages 10–19
نویسندگان
, , , ,