|
|
| Line 1: |
Line 1: |
| An '''attribute-value system''' is a basic [[knowledge representation]] framework comprising a table with '''columns''' designating "attributes" (also known as "properties", "predicates," "features," "dimensions," "characteristics" or "independent variables" depending on the context) and '''rows''' designating "objects" (also known as "entities," "instances," "exemplars," "elements" or "dependent variables"). Each table cell therefore designates the value (also known as "state") of a particular attribute of a particular object.
| | The author is called Wilber Pegues. Credit authorising is how she tends to make a residing. One of the extremely very best issues in the world for him is doing ballet and he'll be beginning something else along with it. For many years he's been residing in Alaska and he doesn't plan on changing it.<br><br>my web page online psychic, [http://srncomm.com/blog/2014/08/25/relieve-that-stress-find-a-new-hobby/ srncomm.com], |
| | |
| == Example of attribute-value system==
| |
| Below is a sample attribute-value system. It represents 10 objects (rows) and five features (columns). In this example, the table contains only integer values. In general, an attribute-value system may contain any kind of data, numeric or otherwise. An attribute-value system is distinguished from a simple "feature list" representation in that each feature in an attribute-value system may possess a range of values (e.g., feature <math>P_{1}</math> below, which has domain of {0,1,2}), rather than simply being ''present'' or ''absent'' {{Harv|Barsalou|Hale|1993}}.
| |
| | |
| :{| class="wikitable" style="text-align:center; width:30%" border="1"
| |
| |+ Sample Attribute-Value System
| |
| ! Object !! <math>P_{1}</math> !! <math>P_{2}</math> !! <math>P_{3}</math> !! <math>P_{4}</math> !! <math>P_{5}</math>
| |
| |-
| |
| ! <math>O_{1}</math>
| |
| | 1 || 2 || 0 || 1 || 1
| |
| |-
| |
| ! <math>O_{2}</math>
| |
| | 1 || 2 || 0 || 1 || 1
| |
| |-
| |
| ! <math>O_{3}</math>
| |
| | 2 || 0 || 0 || 1 || 0
| |
| |-
| |
| ! <math>O_{4}</math>
| |
| | 0 || 0 || 1 || 2 || 1
| |
| |-
| |
| ! <math>O_{5}</math>
| |
| | 2 || 1 || 0 || 2 || 1
| |
| |-
| |
| ! <math>O_{6}</math>
| |
| | 0 || 0 || 1 || 2 || 2
| |
| |-
| |
| ! <math>O_{7}</math>
| |
| | 2 || 0 || 0 || 1 || 0
| |
| |-
| |
| ! <math>O_{8}</math>
| |
| | 0 || 1 || 2 || 2 || 1
| |
| |-
| |
| ! <math>O_{9}</math>
| |
| | 2 || 1 || 0 || 2 || 2
| |
| |-
| |
| ! <math>O_{10}</math>
| |
| | 2 || 0 || 0 || 1 || 0
| |
| |}
| |
| | |
| == Other terms used for "attribute-value system"==
| |
| Attribute-value systems are pervasive throughout many different literatures, and have been discussed under many different names:
| |
| *''Flat data''
| |
| *''[[Spreadsheet]]''
| |
| *''Attribute-value system'' (Ziarko & Shan 1996)
| |
| *''Information system'' ([[Zdzislaw Pawlak|Pawlak]] 1981)
| |
| *''Classification system'' (Ziarko 1998)
| |
| *''Knowledge representation system'' (Wong & Ziarko 1986)
| |
| *''Information table'' (Yao & Yao 2002)
| |
| *''Object-predicate table'' (Watanabe 1985)
| |
| *''Aristotelian table'' (Watanabe 1985)
| |
| *''Simple frames'' {{Harv|Barsalou|Hale|1993}}
| |
| *''[[First normal form]]'' database
| |
| | |
| ==See also==
| |
| *[[Bayes networks]]
| |
| *[[Entity–attribute–value model]]
| |
| *[[Joint distribution]]
| |
| *[[Knowledge representation]]
| |
| *[[wikibooks:Optimal Classification|Optimal classification]]
| |
| *[[Rough set]]
| |
| *[[Triplestore]]
| |
| | |
| == References ==
| |
| * {{Cite book
| |
| | last1=Barsalou
| |
| | given1=Lawrence W.
| |
| | surname2=Hale
| |
| | given2=Christopher R.
| |
| | year= 1993
| |
| | chapter=Components of conceptual representation: From feature lists to recursive frames
| |
| | editor=Iven Van Mechelen, James Hampton, Ryszard S. Michalski, & Peter Theuns
| |
| | title=Categories and Concepts: Theoretical Views and Inductive Data Analysis
| |
| | pages=97–144
| |
| | edition=
| |
| | publisher=Academic Press
| |
| | place=London
| |
| | url=
| |
| | accessdate=
| |
| | ref=harv
| |
| | postscript=<!--None-->}}
| |
| | |
| *{{cite book
| |
| | last = Pawlak
| |
| | first = Zdzisław
| |
| | authorlink = Zdzislaw Pawlak
| |
| | title = Rough sets: Theoretical Aspects of Reasoning about Data
| |
| | publisher = Kluwer
| |
| | year = 1991
| |
| | location = Dordrecht}}
| |
| | |
| *{{cite journal
| |
| | last = Ziarko
| |
| | first = Wojciech
| |
| | coauthors = Shan, Ning
| |
| | title = A method for computing all maximally general rules in attribute-value systems
| |
| | journal = Computational Intelligence
| |
| | volume = 12
| |
| | issue = 2
| |
| | pages = 223–234
| |
| | year = 1996
| |
| | doi = 10.1111/j.1467-8640.1996.tb00260.x
| |
| | ref = harv}}
| |
| | |
| *{{cite journal
| |
| | last = Pawlak
| |
| | first = Zdzisław
| |
| | coauthors = Shan, Ning
| |
| | title = Information systems: Theoretical foundations
| |
| | journal = Information Systems
| |
| | volume = 6
| |
| | issue = 3
| |
| | pages = 205–218
| |
| | year = 1981
| |
| | doi = 10.1016/0306-4379(81)90023-5
| |
| | ref = harv}}
| |
| | |
| *{{cite journal
| |
| | last = Wong
| |
| | first = S. K. M.
| |
| | coauthors = Ziarko, Wojciech and Ye, R. Li
| |
| | title = Comparison of rough-set and statistical methods in inductive learning
| |
| | journal = International Journal of Man-Machine Studies
| |
| | volume = 24
| |
| | pages = 53–72
| |
| | year = 1986
| |
| | ref = harv}}
| |
| | |
| *{{cite conference
| |
| | first = Yao
| |
| | last = J. T.
| |
| | coauthors = Yao, Y. Y.
| |
| | title = Induction of classification rules by granular computing
| |
| | booktitle = Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing (TSCTC'02)
| |
| | pages = 331–338
| |
| | publisher = Springer-Verlag
| |
| | year = 2002
| |
| | location = London, UK}}
| |
| | |
| *{{cite book
| |
| | last = Watanabe
| |
| | first = Satosi
| |
| | title = Pattern Recognition: Human and Mechanical
| |
| | publisher = John Wiley & Sons
| |
| | year = 1985
| |
| | location = New York}}
| |
| | |
| *{{cite conference
| |
| | first = Wojciech
| |
| | last = Ziarko
| |
| | title = Rough sets as a methodology for data mining
| |
| | booktitle = Rough Sets in Knowledge Discovery 1: Methodology and Applications
| |
| | pages = 554–576
| |
| | editor = Polkowski, Lech and Skowron, Andrzej
| |
| | publisher = Physica-Verlag
| |
| | year = 1998
| |
| | location = Heidelberg}}
| |
| | |
| [[Category:Knowledge representation]]
| |
| [[Category:Specific models]]
| |
| | |
| | |
| {{compu-AI-stub}}
| |
The author is called Wilber Pegues. Credit authorising is how she tends to make a residing. One of the extremely very best issues in the world for him is doing ballet and he'll be beginning something else along with it. For many years he's been residing in Alaska and he doesn't plan on changing it.
my web page online psychic, srncomm.com,