<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">REA Press</journal-id>
      <journal-id journal-id-type="publisher-id">null</journal-id>
      <journal-title>REA Press</journal-title><issn pub-type="ppub">3042-1330</issn><issn pub-type="epub">3042-1330</issn><publisher>
      	<publisher-name>REA Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">https://doi.org/10.48313/uda.vi.59</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Rough set, Hyperrough set, Rough TOPSIS, SuperHyperRough set, HyperRough TOPSIS, SuperHyperRough TOPSIS</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>HyperRough TOPSIS method and SuperHyperRough TOPSIS method</article-title><subtitle>HyperRough TOPSIS method and SuperHyperRough TOPSIS method</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Fujita</surname>
		<given-names>Takaaki</given-names>
	</name>
	<aff>Independent Researcher, Shinjuku, Shinjuku-ku, Tokyo, Japan.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>03</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>21</day>
        <month>03</month>
        <year>2025</year>
      </pub-date>
      <volume>2</volume>
      <issue>1</issue>
      <permissions>
        <copyright-statement>© 2025 REA Press</copyright-statement>
        <copyright-year>2025</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>HyperRough TOPSIS method and SuperHyperRough TOPSIS method</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Rough set theory provides a mathematical framework for approximating subsets through lower and upper bounds defined by equivalence relations, effectively capturing uncertainty in classification and data analysis. Building on these foundational ideas, extended models such as Hyperrough Sets and Superhyperrough Sets have been proposed to represent more complex forms of uncertainty. In this paper, we introduce the HyperRough TOPSIS Method and the SuperHyperRough TOPSIS Method, and examine their underlying mathematical structures. TOPSIS is a well-established method in decision-making, and the proposed HyperRough and SuperHyperRough TOPSIS methods serve as generalized extensions of the classical Rough TOPSIS approach.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>