Abstract
It may be argued, rather persuasively, that most of the concepts encountered in various domains of human knowledge are, in reality, much too complex to admit of simple or precise definition. This is true, for example, of the concepts of recession and utility in economics; schizophrenia and arthritis in medicine; stability and adaptivity in system theory; sparseness and stiffness in numerical analysis; grammaticality and meaning in linguistics; performance measurement and correctness in computer science; truth and causality in philosophy; intelligence and creativity in psychology; and obscenity and insanity in law.
The approach described in this paper provides a framework for the definition of such concepts through the use of fuzzy algorithms which have the structure of a branching questionnaire. The starting point is a relational representation of the definiendum as a composite question whose constituent questions are either attributional or classificational in nature. The constituent questions as well as the answers to them are allowed to be fuzzy, e.g., the response to: “How large is x?” might be not very large, and the response to “Is x large?” might be quite true.
By putting the relational representation into an algebraic form, one can derive a fuzzy relation which defines the meaning of the definiendum. This fuzzy relation, then, provides a basis for an interpolation of the relational representation.
To transform a relational representation into an efficient branching questionnaire, the tableau of the relation is subjected to a process of compactification which identifies the conditionally redundant questions. From a maximally compact representation, various efficient realizations which have the structure of a branching questionnaire, with each realization corresponding to a prescribed order of asking the constituent questions, can readily be determined. Then, given the cost of constituent questions as well as the conditional probabilities of answers to them, one can compute the average cost of deducing the answer to the composite question. In this way, a relational representation of a concept leads to an efficient branching questionnaire which may serve as its operational definition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. A. Zadeh, “The Concept of a Linguistic Variable and Its Application to Approximate Reasoning,” Memorandum No. ERL-M411, Electronics Res. Lab., Univ. of Calif., Berkeley, October 1973. ( To appear in Information Sciences. )
L. A. Zadeh, “Outline of a New Approach to the Analysis of Complex Systems and Decision Processes,” IEEE Trans. on Systems, Man and Cybernetics, vol. SMC-3, pp. 28–44, January 1973.
D. H. Krantz, R. D. Luce, P. Suppes, and A. Twersky, Foundations of Measurement, Academic Press, New York, 1971.
R. Carnap, Meaning and Necessity, Univ. of Chicago Press, Chicago, 1956.
C. G. Hempel, “Fundamentals of Concept Formation in Empirical Science,” in International Encyclopedia of Unified Science, vol. 2, 1952.
A. Church, “A Formulation of the Logic of Sense and Denotation,” in Structure, Method and Meaning, Liberal Arts Press, New York, 1951.
W. V. Quine, From a Logical Point of View, Harvard Univ. Press, Cambridge, 1953.
G. Frege, Philosophical Writings, P. Geach and M. Black (eds.), Blackwell, Oxford, 1952.
R. M. Martin, Intension and Decision, Prentice-Hall Inc., Englewood Cliffs, N.J., 1963.
M. Black, “Reasoning with Loose Concepts,” Dialogue, vol. 2, pp. 1–12, 1963.
J. A. Goguen, “The Logic of Inexact Concepts,” Synthese, vol. 19, pp. 325–373, 1969.
K. Fine, “Vagueness, Truth and Logic,” Department of Philosophy, University of Edinburgh, 1973
B. S. van Frassen, “Presuppositions, Supervaluations and Free Logic,” in The Logical Way of. Doing Things, K. Lambert (ed.), Yale Univ. Press, New Haven, 1969.
G. Lakoff, “Linguistic and Natural Logic,” in Semantics of Natural Languages, D. Davidson and G. Harman (eds.), Dordrecht, The Netherlands, D. Reidel, 1971.
A. Tarski, Logic,.Semantics, Metamathematics, Clarendon Press, Oxford, 1956.
M. Scriven, “Definitions, Explanations and Theories,” in H. Feigl, M. Scriven, and G. Maxwell (eds.), Minn. Studies in the Phil. of Sci., vol. 2, Minneapolis, 1958.
H. A. Simon and L. Siklossy (eds.), Representation and Meaning Experiments with Information Processing Systems, Prentice-Hall, Englewood Cliffs, N.J., 1972.
J. Hintikka, J. Moravcsik and P. Suppes (eds.), Approaches to Natural Language, D. Reidel Publ. Co., Dordrecht, The Netherlands, 1973.
M. Minsky (ed.), Semantic Information Processing, MIT Press, Cambridge, 1968.
L. A. Zadeh, “A Fuzzy-Set-Theoretic Interpretation of Linguistic Hedges,” Jour. of Cybernetics, vol. 2, pp. 4–34, 1972.
G. Lakoff, “Hedges: A Study in Meaning Criteria and the Logic of Fuzzy Concepts,” Proc. 8th Regional Meeting of Chicago Linguistic Society, Univ. of Chicago Linguistics Dept., April 1972.
L. A. Zadeh, “Fuzzy Languages and Their Relation to Human and Machine Intelligence,” Proc. of Inter. Conference on Man and Computer, Bordeaux, France, pp. 130–165, S. Karger, Basel, 1972.
L. Silk, “Recesssion: Some Criteria Missing, So Far,” The New York Times, p. 37, August 28, 1974.
L. H. Clark, Jr., “An Economics Group Is the One that Says If There’s Recession,” The Wall Street Journal, p. 1, August 30, 1974.
L. A. Zadeh, “Fuzzy Algorithms,” Inf. Control, vol. 12, pp. 94–102, 1968.
E. Santos, “Fuzzy Algorithms,” Inf. Control, vol. 17, pp. 326–339, 1970.
L. A. Zadeh, “On Fuzzy Algorithms,” Memorandum No, ERL-M325, Electronics Res. Lab., Univ. of California, Berkeley, 1971.
L. A. Zadeh, “Shadows of Fuzzy Sets,” Prob. in Trans. of Information, vol. 2, pp. 37–44, 1966.
E. F. Codd, “Relational Completeness of Data Base Sublanguages,” in Courant Computer Science Symposia, vol. 6, Prentice-Hall, Englewood Hills, N. J., 1971.
P. Lucas, et al., “Method and Notation for the Formal Definition of Programming Languages,” Report TR 25. 087, IBM Laboratory, Vienna, 1968.
P. Wegner, “The Vienna Definition Language,” ACM Computing Surveys, vol. 4, pp. 5–63, 1972.
L. A. Zadeh, “Quantitative Fuzzy Semantics,” Inf. Sci., vol. 3, pp. 159–176, 1971.
R. Sokal and P. Sneath, Principles of Numerical Taxonomy, W. H. Freeman; San Francisco, 1963.
A. J. Cole (ed.), Numerical Taxonomy, Academic Press, New York, 1969.
C. Picard, Theorie des Questionnaires, Gauthier-Villars, Paris, 1965.
A. N. Oppenheim, Questionnaire Design and Attitude Measurement, Basic Books, New York, 1966.
S. Watanabe (ed.), Methodologies of Pattern Recognition, Academic Press, New York, 1969.
K. S. Fu, Sequential Methods in Pattern Recognition and Machine Learning, Academic Press, New York, 1968.
S. M. Selkow, “Diagnostic Keys as a Representation for Context in Pattern Recognition,” IEEE Trans. on Computers, vol. C-23, pp. 970971, 1974.
R. G. Budacker and T. L. Saaty, Finite Graphs and Networks, McGraw-Hill, 1965.
K. S. Fu, Syntactic Methods in Pattern Recognition, Academic Press, New York, 1974.
J. R. Slagle and R. C. T. Lee, “Application of Game Searching Techniques ta Sequential Pattern Recognition,” Comm. ACM, vol. 14, pp. 103–110, 1971.
L. Hyafil and R. L. Rivest, “Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems,” IRIA Res. Rep. 33, Le Chesnay, France, 1973.
W. S. Meisel and D. A. Michalopoulos, “APartitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees,” IEEE Trans. on Computers, vol. C-22, pp. 93–102, 1973.
A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, New York, 1962.
A. A. Tal, “The Abstract Synthesis of Sequential Machines from the Answers to Questions of the First Kind in the Questionnaire Language,” Automation and Remote Control, vol. 26, pp. 675–680, 1965.
A. Gill, “Finite-State Systems,” in System Theory, L. A. Zadeh and E. Polak (eds.), McGraw-Hill, New York, 1969.
A. Kohavi, J. A. Rivierre and I. Kohavi, “Checking Experiments for Sequential Machines,” Inf. Sciences, vol. 7, pp. 11–28, 1974.
T. L. Booth, Sequential Machines and Automata Theory, John Wiley and Sons, New York, 1968.
J. Klir and L. Seidl, Synthesis of Switching Circuits, Iliffe Books Ltd., London, 1966.
Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970.
A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Prentice-Hall, Englewood Hills, N.J., 1973.
E. J. McCluskey, Introduction to the Theory of Switching Circuits, McGraw-Hill, New York, 1965.
A. B. Marcovitz and J. H. Pugsley, An Introduction to Switching System Design, John Wiley and Sons, New York, 1971.
A. Kandel, “On Minimization of Fuzzy Functions,” IEEE Trans. on Computers, vol. C-22, pp. 826–832, 1973.
F. Jelinek, Probabilistic Information Theory, McGraw-Hill, New York, 1968.
C. H. Chen, “Theoretical Comparison of a Class of Feature Selection Criteria in Pattern Recognition,” IEEE Trans. on Computers, vol. C-20, pp. 1054–1056, 1971.
A. N. Mucciardi.and E. E. Gose, “A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties,” IEEE Trans. on Computers, vol. C-20, pp. 1023–1031, 1971.
J. T. Tou and R. P. Heydorn, “Some Approaches to Optimum Feature Extraction,” Computer and Inf. Sci., vol. II, J. T. Tou (ed.), Academic Press, New York, 1967.
N. Jardine and R. Sibson, “Choice of Methods for Automatic Classification,” The Computer Journal, vol. 17, pp. 404–406, 1971.
S. L. Pollack, H. T. Hicks, Jr. and W. J. Harrison, Decision Tables: Theory and Practice, Wiley-Interscience, New York, 1971.
M. Montalbano, “Tables, Flowcharts and Program Logic,” IBM Systems Jour., pp. 51–63, 1962.
L. T. Reinwald and R. M. Soland, “Conversion of Limited-Entry Decision Tables to Optimal Computer Programs,” Parts I and II, Jour. of ACM, vol$113, pp. 339–358, 1966 and vol. 14, pp. 742–758, 1967.
D. A. Bell, “Decision Trees.Made Easy,” Proc. Second International Joint Conf. on Pattern Recognition, pp. 18–21, Copenhagen, Denmark, 1974.
R. E. Gellman, R. Kalaba and L. A. Zadeh, “Abstraction and Pattern Classification,” Jour. Math. Anal. and Appl., vol. 13, pp. 1–7, 1966.
Rights and permissions
Copyright information
© 1976 Springer Basel AG
About this chapter
Cite this chapter
Zadeh, L.A. (1976). A Fuzzy-Algorithmic Approach to the Definition of Complex or Imprecise Concepts. In: Systems Theory in the Social Sciences. Interdisciplinary Systems Research / Interdisziplinäre Systemforschung. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5495-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-0348-5495-5_11
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-0822-3
Online ISBN: 978-3-0348-5495-5
eBook Packages: Springer Book Archive