{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/multiobjective-programming-for-type-2","title":"Multiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees","arxiv_id":"1705.05769","date":"2017-05-16","proceeding":null,"authors":["Varun Kumar Ojha","Vaclav Snasel","Ajith Abraham"],"abstract":"This paper proposes a design of hierarchical fuzzy inference tree (HFIT). An\nHFIT produces an optimum treelike structure, i.e., a natural hierarchical\nstructure that accommodates simplicity by combining several low-dimensional\nfuzzy inference systems (FISs). Such a natural hierarchical structure provides\na high degree of approximation accuracy. The construction of HFIT takes place\nin two phases. Firstly, a nondominated sorting based multiobjective genetic\nprogramming (MOGP) is applied to obtain a simple tree structure (a low\ncomplexity model) with a high accuracy. Secondly, the differential evolution\nalgorithm is applied to optimize the obtained tree's parameters. In the derived\ntree, each node acquires a different input's combination, where the\nevolutionary process governs the input's combination. Hence, HFIT nodes are\nheterogeneous in nature, which leads to a high diversity among the rules\ngenerated by the HFIT. Additionally, the HFIT provides an automatic feature\nselection because it uses MOGP for the tree's structural optimization that\naccepts inputs only relevant to the knowledge contained in data. The HFIT was\nstudied in the context of both type-1 and type-2 FISs, and its performance was\nevaluated through six application problems. Moreover, the proposed\nmultiobjective HFIT was compared both theoretically and empirically with\nrecently proposed FISs methods from the literature, such as McIT2FIS,\nTSCIT2FNN, SIT2FNN, RIT2FNS-WB, eT2FIS, MRIT2NFS, IT2FNN-SVR, etc. From the\nobtained results, it was found that the HFIT provided less complex and highly\naccurate models compared to the models produced by the most of other methods.\nHence, the proposed HFIT is an efficient and competitive alternative to the\nother FISs for function approximation and feature selection.","url_abs":"http://arxiv.org/abs/1705.05769v1","url_pdf":"http://arxiv.org/pdf/1705.05769v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"multiobjective-programming-for-type-2","repo_url":"https://github.com/vojha-code/Hierarchical-Fuzzy-Tree","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-regression","task_name":"Time Series Regression"},{"task_slug":"type","task_name":"Vocal Bursts Type Prediction"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"vojha-code/Hierarchical-Fuzzy-Tree","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1e4c37b91447b0797482b77f0d224ec35014fd0ed229c83055762ed74bf03034","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}