Results 271 to 280 of about 1,151,147 (311)
Some of the next articles are maybe not open access.
Pattern Recognition, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petr Somol, Pavel Pudil
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petr Somol, Pavel Pudil
openaire +1 more source
Feature Selection and Feature Extraction: Highlights
Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, 2021In recent years, big data deluges have resulted in exciting data science opportunities. In particular, there is always a desire to extract the most from different data sources. To address it, a promising and recurring task is to perform feature selection and feature extraction.
Hiu-Man Wong +7 more
openaire +1 more source
Information Sciences, 2019
Abstract In state-of-the-art big-data applications, the process of building machine learning models can be very challenging due to continuous changes in data structures and the need for human interaction to tune the variables and models over time. Hence, expedited learning in rapidly changing environments is required. In this work, we address this
Michal Moran, Goren Gordon
openaire +1 more source
Abstract In state-of-the-art big-data applications, the process of building machine learning models can be very challenging due to continuous changes in data structures and the need for human interaction to tune the variables and models over time. Hence, expedited learning in rapidly changing environments is required. In this work, we address this
Michal Moran, Goren Gordon
openaire +1 more source
Pattern Recognition, 1999
In fuzzy classi"er systems the classi"cation is obtained by a number of fuzzy If}Then rules including linguistic terms such as Low and High that fuzzify each feature. This paper presents a method by which a reduced linguistic (fuzzy) set of a labeled multi-dimensional data set can be identi"ed automatically.
M. Ramze Rezaee +3 more
openaire +1 more source
In fuzzy classi"er systems the classi"cation is obtained by a number of fuzzy If}Then rules including linguistic terms such as Low and High that fuzzify each feature. This paper presents a method by which a reduced linguistic (fuzzy) set of a labeled multi-dimensional data set can be identi"ed automatically.
M. Ramze Rezaee +3 more
openaire +1 more source
Feature Interaction for Streaming Feature Selection
IEEE Transactions on Neural Networks and Learning Systems, 2021Traditional feature selection methods assume that all data instances and features are known before learning. However, it is not the case in many real-world applications that we are more likely faced with data streams or feature streams or both. Feature streams are defined as features that flow in one by one over time, whereas the number of training ...
Peng Zhou 0008 +3 more
openaire +2 more sources
2009 IEEE International Conference on Data Mining Workshops, 2009
Traditional feature selection algorithms require a large number of labeled training instances to find out the most informative subset of features. However, in many real-world applications, the labeled data are often difficult, expensive or time-consuming to obtain.
Wei Bi, Yuan Shi, Zhen-zhong Lan
openaire +1 more source
Traditional feature selection algorithms require a large number of labeled training instances to find out the most informative subset of features. However, in many real-world applications, the labeled data are often difficult, expensive or time-consuming to obtain.
Wei Bi, Yuan Shi, Zhen-zhong Lan
openaire +1 more source
2015 IEEE International Conference on Computer Vision (ICCV), 2015
Feature dimensionality reduction has been widely used in various computer vision tasks. We explore feature selection as the dimensionality reduction technique and propose to use a structured approach, based on the Markov Blanket (MB), to select features. We first introduce a new MB discovery algorithm, Simultaneous Markov Blanket (STMB) discovery, that
Tian Gao, Ziheng Wang 0001, Qiang Ji
openaire +1 more source
Feature dimensionality reduction has been widely used in various computer vision tasks. We explore feature selection as the dimensionality reduction technique and propose to use a structured approach, based on the Markov Blanket (MB), to select features. We first introduce a new MB discovery algorithm, Simultaneous Markov Blanket (STMB) discovery, that
Tian Gao, Ziheng Wang 0001, Qiang Ji
openaire +1 more source
Applied Intelligence, 1998
Feature selection is a problem of finding relevant features. When the number of features of a dataset is large and its number of patterns is huge, an effective method of feature selection can help in dimensionality reduction. An incremental probabilistic algorithm is designed and implemented as an alternative to the exhaustive and heuristic approaches.
Liu, H., Setiono, R.
openaire +1 more source
Feature selection is a problem of finding relevant features. When the number of features of a dataset is large and its number of patterns is huge, an effective method of feature selection can help in dimensionality reduction. An incremental probabilistic algorithm is designed and implemented as an alternative to the exhaustive and heuristic approaches.
Liu, H., Setiono, R.
openaire +1 more source
2015 IEEE International Conference on Computer Vision (ICCV), 2015
Filter-based feature selection has become crucial in many classification settings, especially object recognition, recently faced with feature learning strategies that originate thousands of cues. In this paper, we propose a feature selection method exploiting the convergence properties of power series of matrices, and introducing the concept of ...
ROFFO, GIORGIO +2 more
openaire +3 more sources
Filter-based feature selection has become crucial in many classification settings, especially object recognition, recently faced with feature learning strategies that originate thousands of cues. In this paper, we propose a feature selection method exploiting the convergence properties of power series of matrices, and introducing the concept of ...
ROFFO, GIORGIO +2 more
openaire +3 more sources
33rd Applied Imagery Pattern Recognition Workshop (AIPR'04), 2005
Feature selection is an important part of pattern recognition, helping to overcome the curse of dimensionality problem with classifiers, among other systems. In this work, we introduce a feature selection method using particle swarm optimization. Experiments using data of others and hyperspectral remote sensed data are used to measure the performance ...
Hiram A. Firpi, Erik D. Goodman
openaire +1 more source
Feature selection is an important part of pattern recognition, helping to overcome the curse of dimensionality problem with classifiers, among other systems. In this work, we introduce a feature selection method using particle swarm optimization. Experiments using data of others and hyperspectral remote sensed data are used to measure the performance ...
Hiram A. Firpi, Erik D. Goodman
openaire +1 more source