{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-9639"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-9639","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Feature Selection Via Random Subsets Of Uncorrelated Features","abstract":"The role of feature selection is crucial in many applications. A few of these include computational biology, image classification and risk management. In biology, gene expression micro array data sets have been used extensively in many areas of research. These data sets typically suffer from an important problem: the ratio between the number of features over the number of examples is very high. This problem mainly affects prediction accuracy because it is best to collect more labeled examples than features. A correlation based random subspace ensemble feature selector (CCC_RSM) was proposed to handle this problem [5]. In this approach, first it determines the most relevant prediction features. Next, it groups these features based on their correlation to each other. Then, a feature is randomly chosen from each correlated group so that the selected features form a feature subset. The CCC_RSM algorithm repeats the previous step a pre-defined number of times. The proposed algorithm’s performance is evaluated by combining either multiple decision trees or Support Vector Machines. Joining these models’ predictions together can significantly increase the prediction accuracy. In ensembles of these models, each classifier provides a vote and the majority vote is used to produce the final class prediction. This design modifies the random subspace method ensemble [13]. This study focuses on finding alternative feature selectors in the first step so that the CCC_RSM algorithm can obtain good, or even better classification performance. We used four micro array gene expression data sets in the experiments. Based on the original algorithm, we used the Gini Index in place of Relief-F. A detailed analysis of the alternative method’s outputs ivwas considered: (1) overall and average accuracy, (2) Sensitivity, (3) Specificity, (4) F-measure. Consequently, the alternative method gave the highest F-measure score for the Leukemia (1.00), Breast (0.98), Colon (0.91) and CNS (0.81) data sets.","abstract_html":"The role of feature selection is crucial in many applications. A few of these include computational biology, image classification and risk management. In biology, gene expression micro array data sets have been used extensively in many areas of research. These data sets typically suffer from an important problem: the ratio between the number of features over the number of examples is very high. This problem mainly affects prediction accuracy because it is best to collect more labeled examples than features. A correlation based random subspace ensemble feature selector (CCC_RSM) was proposed to handle this problem [5]. In this approach, first it determines the most relevant prediction features. Next, it groups these features based on their correlation to each other. Then, a feature is randomly chosen from each correlated group so that the selected features form a feature subset. The CCC_RSM algorithm repeats the previous step a pre-defined number of times. The proposed algorithm’s performance is evaluated by combining either multiple decision trees or Support Vector Machines. Joining these models’ predictions together can significantly increase the prediction accuracy. In ensembles of these models, each classifier provides a vote and the majority vote is used to produce the final class prediction. This design modifies the random subspace method ensemble [13]. This study focuses on finding alternative feature selectors in the first step so that the CCC_RSM algorithm can obtain good, or even better classification performance. We used four micro array gene expression data sets in the experiments. Based on the original algorithm, we used the Gini Index in place of Relief-F. A detailed analysis of the alternative method’s outputs ivwas considered: (1) overall and average accuracy, (2) Sensitivity, (3) Specificity, (4) F-measure. Consequently, the alternative method gave the highest F-measure score for the Leukemia (1.00), Breast (0.98), Colon (0.91) and CNS (0.81) data sets.","abstract_has_math":false,"creators":["Dang, Long Kim"],"institution":"University of South Florida","degree_name":"Master of Science (M.S.)","degree_level":"Thesis","degree_discipline":"Computer Science and Engineering","degree_department":null,"school":null,"contributors":["Lawrence Hall, Ph.D.","Dmitry B. Goldgof, Ph.D.","Yu Sun, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020-09-25T07:00:00Z","date_published":"2020-09-25T07:00:00Z","updated_at":"2026-11-19T08:51:02Z","subjects":["Concordance Correlation Coefficient Random Subspace Method","Gene Expression","Gini Index","High Dimensional Data","Random Subspace Method","Bioinformatics","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/8442","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/8442","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-9639","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lawrence Hall, Ph.D.","Dmitry B. Goldgof, Ph.D.","Yu Sun, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Dang, Long Kim"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-09-25T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.S."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (M.S.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Concordance Correlation Coefficient Random Subspace Method","Gene Expression","Gini Index","High Dimensional Data","Random Subspace Method","Bioinformatics","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/8442"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The role of feature selection is crucial in many applications. A few of these include computational biology, image classification and risk management. In biology, gene expression micro array data sets have been used extensively in many areas of research. These data sets typically suffer from an important problem: the ratio between the number of features over the number of examples is very high. This problem mainly affects prediction accuracy because it is best to collect more labeled examples than features. A correlation based random subspace ensemble feature selector (CCC_RSM) was proposed to handle this problem [5]. In this approach, first it determines the most relevant prediction features. Next, it groups these features based on their correlation to each other. Then, a feature is randomly chosen from each correlated group so that the selected features form a feature subset. The CCC_RSM algorithm repeats the previous step a pre-defined number of times. The proposed algorithm’s performance is evaluated by combining either multiple decision trees or Support Vector Machines. Joining these models’ predictions together can significantly increase the prediction accuracy. In ensembles of these models, each classifier provides a vote and the majority vote is used to produce the final class prediction. This design modifies the random subspace method ensemble [13]. This study focuses on finding alternative feature selectors in the first step so that the CCC_RSM algorithm can obtain good, or even better classification performance. We used four micro array gene expression data sets in the experiments. Based on the original algorithm, we used the Gini Index in place of Relief-F. A detailed analysis of the alternative method’s outputs ivwas considered: (1) overall and average accuracy, (2) Sensitivity, (3) Specificity, (4) F-measure. Consequently, the alternative method gave the highest F-measure score for the Leukemia (1.00), Breast (0.98), Colon (0.91) and CNS (0.81) data sets."]},{"key":"dc:title","label":"Title","values":["Feature Selection Via Random Subsets Of Uncorrelated Features"]}]}],"canonical_facts":{"dc:contributor":["Lawrence Hall, Ph.D.","Dmitry B. Goldgof, Ph.D.","Yu Sun, Ph.D."],"dc:creator":["Dang, Long Kim"],"dc:date":["2020-09-25T07:00:00Z"],"dc:description":["The role of feature selection is crucial in many applications. A few of these include computational biology, image classification and risk management. In biology, gene expression micro array data sets have been used extensively in many areas of research. These data sets typically suffer from an important problem: the ratio between the number of features over the number of examples is very high. This problem mainly affects prediction accuracy because it is best to collect more labeled examples than features. A correlation based random subspace ensemble feature selector (CCC_RSM) was proposed to handle this problem [5]. In this approach, first it determines the most relevant prediction features. Next, it groups these features based on their correlation to each other. Then, a feature is randomly chosen from each correlated group so that the selected features form a feature subset. The CCC_RSM algorithm repeats the previous step a pre-defined number of times. The proposed algorithm’s performance is evaluated by combining either multiple decision trees or Support Vector Machines. Joining these models’ predictions together can significantly increase the prediction accuracy. In ensembles of these models, each classifier provides a vote and the majority vote is used to produce the final class prediction. This design modifies the random subspace method ensemble [13]. This study focuses on finding alternative feature selectors in the first step so that the CCC_RSM algorithm can obtain good, or even better classification performance. We used four micro array gene expression data sets in the experiments. Based on the original algorithm, we used the Gini Index in place of Relief-F. A detailed analysis of the alternative method’s outputs ivwas considered: (1) overall and average accuracy, (2) Sensitivity, (3) Specificity, (4) F-measure. Consequently, the alternative method gave the highest F-measure score for the Leukemia (1.00), Breast (0.98), Colon (0.91) and CNS (0.81) data sets."],"dc:identifier":["https://digitalcommons.usf.edu/etd/8442"],"dc:subject":["Concordance Correlation Coefficient Random Subspace Method","Gene Expression","Gini Index","High Dimensional Data","Random Subspace Method","Bioinformatics","Computer Sciences"],"dc:title":["Feature Selection Via Random Subsets Of Uncorrelated Features"],"thesis:degree_discipline":["Computer Science and Engineering"],"thesis:degree_level":["Thesis","M.S."],"thesis:degree_name":["Master of Science (M.S.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:51:02Z"}