<?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.74</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Rough set, Hyperrough set, Weighted rough set, SuperHyperRough set, Sequential rough set</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Weighted hyperrough set and sequential hyperrough set</article-title><subtitle>Weighted hyperrough set and sequential hyperrough set</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>06</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>13</day>
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <volume>3</volume>
      <issue>2</issue>
      <permissions>
        <copyright-statement>© 2026 REA Press</copyright-statement>
        <copyright-year>2026</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>Weighted hyperrough set and sequential hyperrough set</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Rough set theory provides a mathematical framework for approximating subsets using lower and upper bounds defined by equivalence relations, effectively capturing uncertainty in classification and data analysis. Building upon these foundational concepts, further generalizations such as Hyperrough Sets and Superhyperrough Sets have been developed. The Weighted Rough Set is an extension of rough set theory that incorporates importance weights for attributes, enabling more precise classification and approximation. In this paper, we investigate the Weighted Hyperrough Set, Weighted Superhyperrough Set, Sequential Hyperrough Set, and Sequential 𝑛-Superhyperrough Set, each of which extends the fundamental ideas of Weighted Rough Sets and Sequential Rough Sets to more complex and high-dimensional decision environments.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>Null</p>
    </ack>
  </back>
</article>