Loading…
Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy
Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation ta...
Saved in:
Published in: | arXiv.org 2024-06 |
---|---|
Main Authors: | , , , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Huang, Xiaohan Wang, Dongjie Ning, Zhiyuan Qiao, Ziyue Long, Qingqing Zhu, Haowei Wu, Min Zhou, Yuanchun Meng, Xiao |
description | Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation tasks, optimizing decision strategies through performance feedback from downstream tasks. However, these approaches fail to effectively utilize historical decision-making experiences and overlook potential relationships among generated features, thus limiting the depth of knowledge extraction. Moreover, the granularity of the decision-making process lacks dynamic backtracking capabilities for individual features, leading to insufficient adaptability when encountering inefficient pathways, adversely affecting overall robustness and exploration efficiency. To address the limitations observed in current automatic feature engineering frameworks, we introduce a novel method that utilizes a feature-state transformation graph to effectively preserve the entire feature transformation journey, where each node represents a specific transformation state. During exploration, three cascading agents iteratively select nodes and idea mathematical operations to generate new transformation states. This strategy leverages the inherent properties of the graph structure, allowing for the preservation and reuse of valuable transformations. It also enables backtracking capabilities through graph pruning techniques, which can rectify inefficient transformation paths. To validate the efficacy and flexibility of our approach, we conducted comprehensive experiments and detailed case studies, demonstrating superior performance in diverse scenarios. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3067012024</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3067012024</sourcerecordid><originalsourceid>FETCH-proquest_journals_30670120243</originalsourceid><addsrcrecordid>eNqNi98KgjAcRkcQJOU7DLoW5uaf7kvrLijv5adNnazNtknW0yfUA3R1DpzvWyCPMhYGu4jSFfKt7QkhNElpHDMPlZnqQNVCtbiAapRg8AEc4PPgxF28wQmt8FO4DgPOJZ9EJTk-Ghi6oALLb_jChWq0qWfNpkFq871c3Sy8fW3QsgFpuf_jGm3zrNifgsHox8itK3s9GjWnkpEkJSElNGL_rT6YaER8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3067012024</pqid></control><display><type>article</type><title>Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy</title><source>Publicly Available Content Database</source><creator>Huang, Xiaohan ; Wang, Dongjie ; Ning, Zhiyuan ; Qiao, Ziyue ; Long, Qingqing ; Zhu, Haowei ; Wu, Min ; Zhou, Yuanchun ; Meng, Xiao</creator><creatorcontrib>Huang, Xiaohan ; Wang, Dongjie ; Ning, Zhiyuan ; Qiao, Ziyue ; Long, Qingqing ; Zhu, Haowei ; Wu, Min ; Zhou, Yuanchun ; Meng, Xiao</creatorcontrib><description>Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation tasks, optimizing decision strategies through performance feedback from downstream tasks. However, these approaches fail to effectively utilize historical decision-making experiences and overlook potential relationships among generated features, thus limiting the depth of knowledge extraction. Moreover, the granularity of the decision-making process lacks dynamic backtracking capabilities for individual features, leading to insufficient adaptability when encountering inefficient pathways, adversely affecting overall robustness and exploration efficiency. To address the limitations observed in current automatic feature engineering frameworks, we introduce a novel method that utilizes a feature-state transformation graph to effectively preserve the entire feature transformation journey, where each node represents a specific transformation state. During exploration, three cascading agents iteratively select nodes and idea mathematical operations to generate new transformation states. This strategy leverages the inherent properties of the graph structure, allowing for the preservation and reuse of valuable transformations. It also enables backtracking capabilities through graph pruning techniques, which can rectify inefficient transformation paths. To validate the efficacy and flexibility of our approach, we conducted comprehensive experiments and detailed case studies, demonstrating superior performance in diverse scenarios.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Cognitive tasks ; Decision making ; Machine learning ; Optimization ; Performance enhancement ; Tables (data)</subject><ispartof>arXiv.org, 2024-06</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/3067012024?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25732,36991,44569</link.rule.ids></links><search><creatorcontrib>Huang, Xiaohan</creatorcontrib><creatorcontrib>Wang, Dongjie</creatorcontrib><creatorcontrib>Ning, Zhiyuan</creatorcontrib><creatorcontrib>Qiao, Ziyue</creatorcontrib><creatorcontrib>Long, Qingqing</creatorcontrib><creatorcontrib>Zhu, Haowei</creatorcontrib><creatorcontrib>Wu, Min</creatorcontrib><creatorcontrib>Zhou, Yuanchun</creatorcontrib><creatorcontrib>Meng, Xiao</creatorcontrib><title>Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy</title><title>arXiv.org</title><description>Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation tasks, optimizing decision strategies through performance feedback from downstream tasks. However, these approaches fail to effectively utilize historical decision-making experiences and overlook potential relationships among generated features, thus limiting the depth of knowledge extraction. Moreover, the granularity of the decision-making process lacks dynamic backtracking capabilities for individual features, leading to insufficient adaptability when encountering inefficient pathways, adversely affecting overall robustness and exploration efficiency. To address the limitations observed in current automatic feature engineering frameworks, we introduce a novel method that utilizes a feature-state transformation graph to effectively preserve the entire feature transformation journey, where each node represents a specific transformation state. During exploration, three cascading agents iteratively select nodes and idea mathematical operations to generate new transformation states. This strategy leverages the inherent properties of the graph structure, allowing for the preservation and reuse of valuable transformations. It also enables backtracking capabilities through graph pruning techniques, which can rectify inefficient transformation paths. To validate the efficacy and flexibility of our approach, we conducted comprehensive experiments and detailed case studies, demonstrating superior performance in diverse scenarios.</description><subject>Cognitive tasks</subject><subject>Decision making</subject><subject>Machine learning</subject><subject>Optimization</subject><subject>Performance enhancement</subject><subject>Tables (data)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNi98KgjAcRkcQJOU7DLoW5uaf7kvrLijv5adNnazNtknW0yfUA3R1DpzvWyCPMhYGu4jSFfKt7QkhNElpHDMPlZnqQNVCtbiAapRg8AEc4PPgxF28wQmt8FO4DgPOJZ9EJTk-Ghi6oALLb_jChWq0qWfNpkFq871c3Sy8fW3QsgFpuf_jGm3zrNifgsHox8itK3s9GjWnkpEkJSElNGL_rT6YaER8</recordid><startdate>20240611</startdate><enddate>20240611</enddate><creator>Huang, Xiaohan</creator><creator>Wang, Dongjie</creator><creator>Ning, Zhiyuan</creator><creator>Qiao, Ziyue</creator><creator>Long, Qingqing</creator><creator>Zhu, Haowei</creator><creator>Wu, Min</creator><creator>Zhou, Yuanchun</creator><creator>Meng, Xiao</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240611</creationdate><title>Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy</title><author>Huang, Xiaohan ; Wang, Dongjie ; Ning, Zhiyuan ; Qiao, Ziyue ; Long, Qingqing ; Zhu, Haowei ; Wu, Min ; Zhou, Yuanchun ; Meng, Xiao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_30670120243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Cognitive tasks</topic><topic>Decision making</topic><topic>Machine learning</topic><topic>Optimization</topic><topic>Performance enhancement</topic><topic>Tables (data)</topic><toplevel>online_resources</toplevel><creatorcontrib>Huang, Xiaohan</creatorcontrib><creatorcontrib>Wang, Dongjie</creatorcontrib><creatorcontrib>Ning, Zhiyuan</creatorcontrib><creatorcontrib>Qiao, Ziyue</creatorcontrib><creatorcontrib>Long, Qingqing</creatorcontrib><creatorcontrib>Zhu, Haowei</creatorcontrib><creatorcontrib>Wu, Min</creatorcontrib><creatorcontrib>Zhou, Yuanchun</creatorcontrib><creatorcontrib>Meng, Xiao</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huang, Xiaohan</au><au>Wang, Dongjie</au><au>Ning, Zhiyuan</au><au>Qiao, Ziyue</au><au>Long, Qingqing</au><au>Zhu, Haowei</au><au>Wu, Min</au><au>Zhou, Yuanchun</au><au>Meng, Xiao</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy</atitle><jtitle>arXiv.org</jtitle><date>2024-06-11</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation tasks, optimizing decision strategies through performance feedback from downstream tasks. However, these approaches fail to effectively utilize historical decision-making experiences and overlook potential relationships among generated features, thus limiting the depth of knowledge extraction. Moreover, the granularity of the decision-making process lacks dynamic backtracking capabilities for individual features, leading to insufficient adaptability when encountering inefficient pathways, adversely affecting overall robustness and exploration efficiency. To address the limitations observed in current automatic feature engineering frameworks, we introduce a novel method that utilizes a feature-state transformation graph to effectively preserve the entire feature transformation journey, where each node represents a specific transformation state. During exploration, three cascading agents iteratively select nodes and idea mathematical operations to generate new transformation states. This strategy leverages the inherent properties of the graph structure, allowing for the preservation and reuse of valuable transformations. It also enables backtracking capabilities through graph pruning techniques, which can rectify inefficient transformation paths. To validate the efficacy and flexibility of our approach, we conducted comprehensive experiments and detailed case studies, demonstrating superior performance in diverse scenarios.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_3067012024 |
source | Publicly Available Content Database |
subjects | Cognitive tasks Decision making Machine learning Optimization Performance enhancement Tables (data) |
title | Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T13%3A38%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Enhancing%20Tabular%20Data%20Optimization%20with%20a%20Flexible%20Graph-based%20Reinforced%20Exploration%20Strategy&rft.jtitle=arXiv.org&rft.au=Huang,%20Xiaohan&rft.date=2024-06-11&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3067012024%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_30670120243%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3067012024&rft_id=info:pmid/&rfr_iscdi=true |