<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                                                <journal-id>makufebed</journal-id>
            <journal-title-group>
                                                                                    <journal-title>Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi</journal-title>
            </journal-title-group>
                                        <issn pub-type="epub">1309-2243</issn>
                                                                                            <publisher>
                    <publisher-name>Burdur Mehmet Akif Ersoy University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id pub-id-type="doi">10.29048/makufebed.416745</article-id>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Engineering</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Mühendislik</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <article-title>Üst Yaklaşım Sayılarının Öncül Komşuluklarla Elde Edilmesi</article-title>
                                                                                                                                                                                                <trans-title-group xml:lang="en">
                                    <trans-title>Obtaining Upper Approximation Numbers with Predecessor Neighborhoods</trans-title>
                                </trans-title-group>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                <name>
                                    <surname>Bayhan</surname>
                                    <given-names>Sadık</given-names>
                                </name>
                                                                    <aff>Mehmet Akif Ersoy University Turkey</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Baytaroğlu</surname>
                                    <given-names>Nazlı Tuğçe</given-names>
                                </name>
                                                                    <aff>Mehmet Akif Ersoy University Turkey</aff>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20180612">
                    <day>06</day>
                    <month>12</month>
                    <year>2018</year>
                </pub-date>
                                        <volume>9</volume>
                                        <issue>2</issue>
                                        <fpage>151</fpage>
                                        <lpage>156</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20180418">
                        <day>04</day>
                        <month>18</month>
                        <year>2018</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20180601">
                        <day>06</day>
                        <month>01</month>
                        <year>2018</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2010, The Journal of Graduate School of Natural and Applied Sciences of Mehmet Akif Ersoy University</copyright-statement>
                    <copyright-year>2010</copyright-year>
                    <copyright-holder>The Journal of Graduate School of Natural and Applied Sciences of Mehmet Akif Ersoy University</copyright-holder>
                </permissions>
            
                                                                                                <abstract><p>Kaba küme teorisi belirsizliğe matematiksel biryaklaşım olarak düşünülmüş; yararlı ve etkili bir araç olarak çeşitli bilimalanlarında kullanılmaktadır. Lineer cebirde yer alan lineer bağımlılık, lineerbağımsızlık, taban, rank gibi temel kavramlarının genelleştirilmesi Matroidteorisiyle olanaklı olmuştur. Bu çalışmadabir bağıntıdan oluşturulan matroid için öncül komşuluklara dayalı üstyaklaşım sayısal fonksiyonu tanımlanarak genelleştirilmiş kaba kümelerle ilişkileriincelenmiştir.</p></abstract>
                                                                                                                                    <trans-abstract xml:lang="en">
                            <p>Rough set theory is considered as a mathematical approach to uncertaintyas a useful and effective tool in various fields of science. The generalizationof the basic concepts such as linear dependence, linear independence, base andrank in linear algebra is possible by matroid theory. In this study, the upperapproximation number function based on predecessor neighborhoods will bedefined for the matroid generated from a relation and generalized rough setsassociations will be examined.</p></trans-abstract>
                                                            
            
                                                            <kwd-group>
                                                    <kwd>Kaba küme</kwd>
                                                    <kwd>  Matroid</kwd>
                                                    <kwd>  Alt yaklaşım</kwd>
                                                    <kwd>  Üst yaklaşım</kwd>
                                            </kwd-group>
                                                        
                                                                            <kwd-group xml:lang="en">
                                                    <kwd>Rough set</kwd>
                                                    <kwd>  Matroid</kwd>
                                                    <kwd>  Lower approximation</kwd>
                                                    <kwd>  Upper approximation</kwd>
                                            </kwd-group>
                                                                                                            </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">Oxley,  J. (1992). Matroid Theory, Oxford University Press, New York.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">Pawlak, Z. (1982). Rough sets, International Journal of Computer &amp; Information Sciences        11 (5): 341–356.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">Whitney, H. (1935). On the abstract properties of linear dependence,, Amer. J. Math. 57:        509-533.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">Yao,  Y. Y. (1996). Two views of the theory of rough sets in finite universes, International        Journal  of Approximate Reasoning. 15 (4): 291–317.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">Yao, Y. Y. (1998). Constructive and algebraic methods of the theory of rough sets,        Information Sciences 109: 21–47.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">Yao , Y. Y. (1998).  Relational interpretational of neighborhood operators and rough set        approximation operators, Information Sciences 111: 239–259.</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">Zhu, W. (2007). Generalized rough sets based on relations, Information Sciences. 177:        4997-5011.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">Zhu, W. (2009). Relationship between generalized rough sets based on binary relation and       covering, Information Sciences 179: 210–225.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">Zhu, W., Wang, S. (2011). Matroidal approaches to generalized rough sets based on      relations, International Journal of Machine Learning and Cybernetics 2: 273–  279.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
