Attribute dependencies for data with grades I
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Belohlavek, R [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of general systems - New York, NY [u.a.] : Gordon & Breach, 1974, 45(2016), 7-8, Seite 864-888 |
|---|---|
| Übergeordnetes Werk: |
volume:45 ; year:2016 ; number:7-8 ; pages:864-888 |
| Links: |
|---|
| DOI / URN: |
10.1080/03081079.2016.1205711 |
|---|
| Katalog-ID: |
OLC198715875X |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC198715875X | ||
| 003 | DE-627 | ||
| 005 | 20220215161138.0 | ||
| 007 | tu | ||
| 008 | 170207s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1080/03081079.2016.1205711 |2 doi | |
| 028 | 5 | 2 | |a PQ20170301 |
| 035 | |a (DE-627)OLC198715875X | ||
| 035 | |a (DE-599)GBVOLC198715875X | ||
| 035 | |a (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 | ||
| 035 | |a (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 000 |q DE-600 |
| 084 | |a 30.10 |2 bkl | ||
| 100 | 1 | |a Belohlavek, R |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Attribute dependencies for data with grades I |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. | ||
| 540 | |a Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 | ||
| 650 | 4 | |a fuzzy logic | |
| 650 | 4 | |a similarity | |
| 650 | 4 | |a grade | |
| 650 | 4 | |a functional dependence | |
| 650 | 4 | |a Attribute dependence | |
| 650 | 4 | |a redundancy | |
| 650 | 4 | |a Fuzzy logic | |
| 700 | 1 | |a Vychodil, V |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of general systems |d New York, NY [u.a.] : Gordon & Breach, 1974 |g 45(2016), 7-8, Seite 864-888 |w (DE-627)129094838 |w (DE-600)7328-3 |w (DE-576)014430894 |x 0308-1079 |7 nnns |
| 773 | 1 | 8 | |g volume:45 |g year:2016 |g number:7-8 |g pages:864-888 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1080/03081079.2016.1205711 |3 Volltext |
| 856 | 4 | 2 | |u http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1853333635 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 30.10 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 45 |j 2016 |e 7-8 |h 864-888 | ||
| author_variant |
r b rb |
|---|---|
| matchkey_str |
article:03081079:2016----::trbtdpnecefra |
| hierarchy_sort_str |
2016 |
| bklnumber |
30.10 |
| publishDate |
2016 |
| allfields |
10.1080/03081079.2016.1205711 doi PQ20170301 (DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi DE-627 ger DE-627 rakwb eng 000 DE-600 30.10 bkl Belohlavek, R verfasserin aut Attribute dependencies for data with grades I 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic Vychodil, V oth Enthalten in International journal of general systems New York, NY [u.a.] : Gordon & Breach, 1974 45(2016), 7-8, Seite 864-888 (DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 0308-1079 nnns volume:45 year:2016 number:7-8 pages:864-888 http://dx.doi.org/10.1080/03081079.2016.1205711 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 30.10 AVZ AR 45 2016 7-8 864-888 |
| spelling |
10.1080/03081079.2016.1205711 doi PQ20170301 (DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi DE-627 ger DE-627 rakwb eng 000 DE-600 30.10 bkl Belohlavek, R verfasserin aut Attribute dependencies for data with grades I 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic Vychodil, V oth Enthalten in International journal of general systems New York, NY [u.a.] : Gordon & Breach, 1974 45(2016), 7-8, Seite 864-888 (DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 0308-1079 nnns volume:45 year:2016 number:7-8 pages:864-888 http://dx.doi.org/10.1080/03081079.2016.1205711 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 30.10 AVZ AR 45 2016 7-8 864-888 |
| allfields_unstemmed |
10.1080/03081079.2016.1205711 doi PQ20170301 (DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi DE-627 ger DE-627 rakwb eng 000 DE-600 30.10 bkl Belohlavek, R verfasserin aut Attribute dependencies for data with grades I 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic Vychodil, V oth Enthalten in International journal of general systems New York, NY [u.a.] : Gordon & Breach, 1974 45(2016), 7-8, Seite 864-888 (DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 0308-1079 nnns volume:45 year:2016 number:7-8 pages:864-888 http://dx.doi.org/10.1080/03081079.2016.1205711 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 30.10 AVZ AR 45 2016 7-8 864-888 |
| allfieldsGer |
10.1080/03081079.2016.1205711 doi PQ20170301 (DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi DE-627 ger DE-627 rakwb eng 000 DE-600 30.10 bkl Belohlavek, R verfasserin aut Attribute dependencies for data with grades I 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic Vychodil, V oth Enthalten in International journal of general systems New York, NY [u.a.] : Gordon & Breach, 1974 45(2016), 7-8, Seite 864-888 (DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 0308-1079 nnns volume:45 year:2016 number:7-8 pages:864-888 http://dx.doi.org/10.1080/03081079.2016.1205711 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 30.10 AVZ AR 45 2016 7-8 864-888 |
| allfieldsSound |
10.1080/03081079.2016.1205711 doi PQ20170301 (DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi DE-627 ger DE-627 rakwb eng 000 DE-600 30.10 bkl Belohlavek, R verfasserin aut Attribute dependencies for data with grades I 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic Vychodil, V oth Enthalten in International journal of general systems New York, NY [u.a.] : Gordon & Breach, 1974 45(2016), 7-8, Seite 864-888 (DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 0308-1079 nnns volume:45 year:2016 number:7-8 pages:864-888 http://dx.doi.org/10.1080/03081079.2016.1205711 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 30.10 AVZ AR 45 2016 7-8 864-888 |
| language |
English |
| source |
Enthalten in International journal of general systems 45(2016), 7-8, Seite 864-888 volume:45 year:2016 number:7-8 pages:864-888 |
| sourceStr |
Enthalten in International journal of general systems 45(2016), 7-8, Seite 864-888 volume:45 year:2016 number:7-8 pages:864-888 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic |
| dewey-raw |
000 |
| isfreeaccess_bool |
false |
| container_title |
International journal of general systems |
| authorswithroles_txt_mv |
Belohlavek, R @@aut@@ Vychodil, V @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
129094838 |
| dewey-sort |
0 |
| id |
OLC198715875X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC198715875X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215161138.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03081079.2016.1205711</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198715875X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198715875X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">30.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Belohlavek, R</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Attribute dependencies for data with grades I</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fuzzy logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">similarity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">grade</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">functional dependence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Attribute dependence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">redundancy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fuzzy logic</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vychodil, V</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of general systems</subfield><subfield code="d">New York, NY [u.a.] : Gordon & Breach, 1974</subfield><subfield code="g">45(2016), 7-8, Seite 864-888</subfield><subfield code="w">(DE-627)129094838</subfield><subfield code="w">(DE-600)7328-3</subfield><subfield code="w">(DE-576)014430894</subfield><subfield code="x">0308-1079</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:45</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:7-8</subfield><subfield code="g">pages:864-888</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/03081079.2016.1205711</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1853333635</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">30.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">45</subfield><subfield code="j">2016</subfield><subfield code="e">7-8</subfield><subfield code="h">864-888</subfield></datafield></record></collection>
|
| author |
Belohlavek, R |
| spellingShingle |
Belohlavek, R ddc 000 bkl 30.10 misc fuzzy logic misc similarity misc grade misc functional dependence misc Attribute dependence misc redundancy misc Fuzzy logic Attribute dependencies for data with grades I |
| authorStr |
Belohlavek, R |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129094838 |
| format |
Article |
| dewey-ones |
000 - Computer science, information & general works |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0308-1079 |
| topic_title |
000 DE-600 30.10 bkl Attribute dependencies for data with grades I fuzzy logic similarity grade functional dependence Attribute dependence redundancy Fuzzy logic |
| topic |
ddc 000 bkl 30.10 misc fuzzy logic misc similarity misc grade misc functional dependence misc Attribute dependence misc redundancy misc Fuzzy logic |
| topic_unstemmed |
ddc 000 bkl 30.10 misc fuzzy logic misc similarity misc grade misc functional dependence misc Attribute dependence misc redundancy misc Fuzzy logic |
| topic_browse |
ddc 000 bkl 30.10 misc fuzzy logic misc similarity misc grade misc functional dependence misc Attribute dependence misc redundancy misc Fuzzy logic |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
v v vv |
| hierarchy_parent_title |
International journal of general systems |
| hierarchy_parent_id |
129094838 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
International journal of general systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129094838 (DE-600)7328-3 (DE-576)014430894 |
| title |
Attribute dependencies for data with grades I |
| ctrlnum |
(DE-627)OLC198715875X (DE-599)GBVOLC198715875X (PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270 (KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi |
| title_full |
Attribute dependencies for data with grades I |
| author_sort |
Belohlavek, R |
| journal |
International journal of general systems |
| journalStr |
International journal of general systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
864 |
| author_browse |
Belohlavek, R |
| container_volume |
45 |
| class |
000 DE-600 30.10 bkl |
| format_se |
Aufsätze |
| author-letter |
Belohlavek, R |
| doi_str_mv |
10.1080/03081079.2016.1205711 |
| dewey-full |
000 |
| title_sort |
attribute dependencies for data with grades i |
| title_auth |
Attribute dependencies for data with grades I |
| abstract |
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. |
| abstractGer |
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. |
| abstract_unstemmed |
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
7-8 |
| title_short |
Attribute dependencies for data with grades I |
| url |
http://dx.doi.org/10.1080/03081079.2016.1205711 http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711 http://search.proquest.com/docview/1853333635 |
| remote_bool |
false |
| author2 |
Vychodil, V |
| author2Str |
Vychodil, V |
| ppnlink |
129094838 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1080/03081079.2016.1205711 |
| up_date |
2024-07-04T05:48:02.478Z |
| _version_ |
1803626303947014144 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC198715875X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215161138.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03081079.2016.1205711</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198715875X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198715875X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1830-53ccced70196bbc97d61441a7f0cd1d5af67f95bbf3903caeae4a011cffec5270</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019725420160000045000700864attributedependenciesfordatawithgradesi</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">30.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Belohlavek, R</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Attribute dependencies for data with grades I</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or "fuzzy", attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match based on equality in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic, a recently developed many-valued logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the first part of this two-part paper, we discuss motivations, provide basic notions of syntax and semantics and develop basic results which include entailment of dependencies, associated closure structures and a logic of dependencies with two versions of completeness theorem.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fuzzy logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">similarity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">grade</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">functional dependence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Attribute dependence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">redundancy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fuzzy logic</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vychodil, V</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of general systems</subfield><subfield code="d">New York, NY [u.a.] : Gordon & Breach, 1974</subfield><subfield code="g">45(2016), 7-8, Seite 864-888</subfield><subfield code="w">(DE-627)129094838</subfield><subfield code="w">(DE-600)7328-3</subfield><subfield code="w">(DE-576)014430894</subfield><subfield code="x">0308-1079</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:45</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:7-8</subfield><subfield code="g">pages:864-888</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/03081079.2016.1205711</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/03081079.2016.1205711</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1853333635</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">30.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">45</subfield><subfield code="j">2016</subfield><subfield code="e">7-8</subfield><subfield code="h">864-888</subfield></datafield></record></collection>
|
| score |
7.398944 |