A Fuzzy-Based Fast Feature Selection Using Divide and Conquer Technique in Huge Dimension Dataset
نویسندگان
چکیده
Feature selection is commonly employed for identifying the top n features that significantly contribute to desired prediction, example, find 50 or 100 genes responsible lung kidney cancer out of 50,000 genes. Thus, it a huge time- and resource-consuming practice. In this work, we propose divide-and-conquer technique with fuzzy backward feature elimination (FBFE) helps important quickly accurately. To show robustness proposed method, applied eight different datasets taken from NCBI database. We compare method seven state-of-the-art methods can obtain fast better classification accuracy. The will work qualitative, quantitative, continuous, discrete datasets. A web service developed researchers academicians select features.
منابع مشابه
Fast Feature Selection Using Fractal Dimension
Dimensionality curse and dimensionality reduction are two issues that have retained high interest for data mining, machine learning, multimedia indexing, and clustering. We present a fast, scalable algorithm to quickly select the most important attributes (dimensions) for a given set of n-dimensional vectors. In contrast to older methods, our method has the following desirable properties: (a) i...
متن کاملFast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets
Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...
متن کاملA Fast Parallel Squarer Based on Divide and Conquer
Fast and small squarers are needed in many applications such as image compression A new family of high performance parallel squarers based on the divide and conquer method is reported Our main result was realizing the basis cases of the divide and conquer recursion by using optimized n bit primitive squarers where n is in the range of to This method reduced the gate count and provided shorter c...
متن کاملFast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm searches line-by-line, top to bottom, to assign a blob label to each current pixel that is connected to a blob. A large number K of labels arises of which many are equivalent, so the equivalence must be resolved. This requ...
متن کاملEfficient Divide-And-Conquer Classification Based on Feature-Space Decomposition
This study presents a divide-and-conquer (DC) approach based on feature space decomposition for classification. When large-scale datasets are present, typical approaches usually employed truncated kernel methods on the feature space or DC approaches on the sample space. However, this did not guarantee separability between classes, owing to overfitting. To overcome such problems, this work propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11040920