Showing papers on "Generalization published in 1983"
TL;DR: Estimation techniques are developed for the special case of a single relation social network, with blocks specified a priori, and an extension of the model allows for tendencies toward reciprocation of ties beyond those explained by the partition.
2,792 citations
01 Jan 1983
TL;DR: In this article, a definition of the concept "intuitionistic fuzzy set" (IFS) is given, the latter being a generalization of the Fuzzy Set and an example is described.
Abstract: A definition of the concept 'intuitionistic fuzzy set' (IFS) is given, the latter being a generalization of the concept 'fuzzy set' and an example is described. Various properties are proved, which are connected to the operations and relations over sets, and with modal and topological operators, defined over the set of IFS's.
2,256 citations
TL;DR: The authors view inductive learning as a heuristic search through a space of symbolic descriptions, generated by an application of various inference rules to the initial observational statements, including generalization rules, which perform generalizing transformations on descriptions, and conventional truth-preserving deductive rules.
1,333 citations
602 citations
01 Nov 1983-International Journal of Human-computer Studies \/ International Journal of Man-machine Studies
TL;DR: It is proposed that a generalization of the set covering problem can be used as an intuitively plausible model for diagnostic problem solving and potentially useful as a basis for expert systems in that it provides a solution to the difficult problem of multiple simultaneous disorders.
Abstract: This paper proposes that a generalization of the set covering problem can be used as an intuitively plausible model for diagnostic problem solving. Such a model is potentially useful as a basis for expert systems in that it provides a solution to the difficult problem of multiple simultaneous disorders. We briefly introduce the theoretical model and then illustrate its application in diagnostic expert systems. Several challenging issues arise in adopting the set covering model to real-world problems, and these are also discussed along with the solutions we have adopted.
418 citations
TL;DR: The authors obtain some results of the form: If certain complexity classes satisfy a non-uniform condition, then some unlikely consequences follow.
285 citations
TL;DR: A model of generalization that is part of a system for language understanding, the Integrated Partial Parser (IPP), includes the retrieval of relevant examples from long-term memory so that the concepts to be created can be determined when new stories are read.
195 citations
01 Jan 1983
TL;DR: In this article, a general methodology for learning structural descriptions from examples, called Star, is described and illustrated by a problem from the area of conceptual data analysis, which is constrained by problem background knowledge, and guided by criteria evaluating the "quality" of generated inductive assertions.
Abstract: The presented theory views inductive learning as a heuristic search through a space of symbolic descriptions, generated by an application of various inference rules to the initial observational statements. The inference rules include generalization rules, which perform generalizing transformations on descriptions, and conventional truth-preserving deductive rules. The application of the inference rules to descriptions is constrained by problem background knowledge, and guided by criteria evaluating the “quality” of generated inductive assertions.
Based on this theory, a general methodology for learning structural descriptions from examples, called Star, is described and illustrated by a problem from the area of conceptual data analysis.
139 citations
Proceedings Article•
31 Oct 1983
TL;DR: This paper defines the class of conjunctive generalization queries, and it describes four tactics for processing those queries that have boon developed for the MDLTIDASE system, and shows how to model generalization as a sequence of algebraic operations.
Abstract: An important task of multidatabase systems is the integration of existing databases. Database Integration is achieved primarily through the use of generalization. Hence, it is important to develop good tactics for processing queries over generalization hierarchies. This paper defines the class of conjunctive generalization queries, and it describes four tactics for processing those queries that have boon developed for the MDLTIDASE system. Since query processing tactics are best describe algebraically, the paper shows how to model generalization as a sequence of algebraic operations. Three of the tactics described here are adapted from convontional distributed query processing techniqaes. However, it is argued that these tactics are of limited applicability to processing queries over generalization hierarchies. A fourth tactic, semioutorjoin, which is more widely applicable. is introduced. This research was jointly supported by the Defense Advanced Research Projects Agency of the Department of Defense and the Naval Electronic Systems Command and was monitored by the Naval Electronic Systems Command under Contract No. NOOO39-82-C-0226. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, oithor expressed or implied, of the DARPA, NAVPLEX, or the U.S. Government.
101 citations
TL;DR: In this paper, a new integral identity is adapted from Carlson to represent the moments of quadratic forms under multivariate normal and, more generally, elliptically contoured distributions, which permits the computation of such moments by simple quadrature.
Abstract: This article reviews and interprets recent mathematics of special functions, with emphasis on integral representations of multiple hypergeometric functions. B.C. Carlson's centrally important parameterized functions R and ℛ, initially defined as Dirichlet averages, are expressed as probability-generating functions of mixed multinomial distributions. Various nested families generalizing the Dirichlet distributions are developed for Bayesian inference in multinomial sampling and contingency tables. In the case of many-way tables, this motivates a new generalization of the function ℛ. These distributions are also useful for the modeling of populations of personal probabilities evolving under the process of inference from statistical data. A remarkable new integral identity is adapted from Carlson to represent the moments of quadratic forms under multivariate normal and, more generally, elliptically contoured distributions. This permits the computation of such moments by simple quadrature.
94 citations
TL;DR: It is concluded that only limited aspects of generalization and maintenance questions in parent training have been addressed and several persisting methodological deficiencies that have hampered the development and evaluation of effective generalization programming technologies are highlighted.
Abstract: The article reviews the literature on the extratraining effects of bahavioral family intervention relating to parent behaviour. The review classifies generalization and maintenance into several distinct categories suggested by Drabman, Hammer, and Rosenbaum (1979). The authors conclude that only limited aspects of generalization and maintenance questions in parent training have been addressed and highlight several persisting methodological deficiencies that have hampered the development and evaluation of effective generalization programming technologies.
TL;DR: In this paper, the authors proposed an estimator for a large sparse contingency table by maximizing the likelihood modified by a roughness penalty, which is consistent in a one-dimensional table under a sparse asymptotic framework.
Abstract: Probabilities in a large sparse contingency table are estimated by maximizing the likelihood modified by a roughness penalty. It is shown that if certain smoothness criteria on the underlying probability vector are met, the estimator proposed is consistent in a one-dimensional table under a sparse asymptotic framework. Suggestions are made for techniques to apply the estimator in practice, and generalization to higher dimensional tables is considered.
TL;DR: The fundamental concepts and equations of a birth-death process are presented and applied to software reliability modeling, and the practical application of the model in the reliability assessment of a software package is discussed.
Abstract: Many software reliability time-domain bug-counting models are, as fault counters, special cases of the stochastic process known as the death process. Generalization to a nonhomogeneous birth-death process achieves three ends: stochastic fault introduction, the synthesis of a time-dependent failure rate with imperfect debugging and fault introduction, and the mathematical unification of much bug-counting theory. Often, the price for generalization is mathematical intractability. Yet useful and tractable reliability measures with strong intuitive appeal are derived. The paper opens with a brief general discussion of software reliability and a selective review of some bug-counting models. Thereafter, the fundamental concepts and equations of a birth-death process are presented and applied to software reliability modeling. Assumptions for this application are then dealt with at some length. Reliability measures-initial, present, and future - are developed. Finally. the practical application of the model in the reliability assessment of a software package is discussed.
Book•
01 Jan 1983
22 Aug 1983
TL;DR: An overview of RESEARCHER, a computer system being developed at Columbia that reads natural language text in the form of patent abstracts and creates a permanent long-term memory based on concepts generalized from these texts, forming an intelligent information system.
Abstract: Described in this paper is a computer system, RESEARCHER, being developed at Columbia that reads natural language text in the form of patent abstracts and creates a permanent long-term memory based on concepts generalized from these texts, forming an intelligent information system. This paper is intended to give an overview of RESEARCHER. We will describe briefly the four main areas dealt with in the design of RESEARCHER: 1) knowledge representation, where a canonical scheme for representing physical objects has been developed, 2) memory-based text processing, 3) generalization and generalization-based memory organization that treats concept formation as an integral part of understanding, and 4) generalization-based question answering.
TL;DR: In this article, the classical results of Routh and Hurwitz on the stability of polynomials are generalized from the open left half plane to certain other subregions G of the complex plane.
Abstract: The classical results of Routh and Hurwitz on the stability of polynomials are generalized from the open left half plane to certain other subregions G of the complex plane. By our method, arbitrary conic sections can be handled. The results are interpreted as criteria for G -stability of linear systems. A numerical algorithm to compute the criteria is given. An application to a problem in robust controller design is outlined.
TL;DR: In this article, it is proved that if these forms of dependence are present in contingency tables, then the orderings are reflected in the correspondence analysis solution, whatever a priori ordering may have been given to the categories.
Abstract: In this paper we introduce successively stronger forms of ordinal dependence between categorical variables, corresponding to orderings over the categories of the variables. In our main theorem it is proved that if these forms of dependence are present in contingency tables, then the orderings are reflected in the correspondence analysis solution, whatever a priori ordering may have been given to the categories. This explains two important order phenomena which frequently occur in practice. Furthermore a multivariate generalization of the main theorem is given. The results in this paper support the use of (multi-) correspondence analysis as a scaling technique for categorical variables.
TL;DR: In this paper, a multivariate generalization of isotonic regression is given enabling the study of statistical inference for ordered vector-valued parameters or sets of ordered parameters, including multivariate extensions of Bartholomew's 22 and 4 2.
Abstract: SUMMARY A multivariate generalization of isotonic regression is given enabling the study of statistical inference for ordered vector-valued parameters or sets of ordered parameters, including multivariate extensions of Bartholomew's 22 and 4 2. An iterative algorithm for computing multivariate isotonic regression is proposed and studied.
TL;DR: The principle of operator separation, a generalization of operator splitting, is applied to some problems in reflection seismology as mentioned in this paper, in particular the examples of wave-equation migration of seismic data in a three-dimensional medium and accurate depth migration in a laterally varying medium.
Abstract: The principle of operator separation, a generalization of operator splitting, is applied to some problems in reflection seismology. In particular, the examples of wave-equation migration of seismic data in a three-dimensional medium and accurate depth migration in a laterally varying medium are considered in light of this theory. For the case of a stratified three-dimensional medium, the standard dimensional splitting technique used in the downward-continuation step of the migration process can be replaced with full dimensional separation. The computational implications of this result are that the wave field array need only be transposed once during the downward continuation rather than 2n times, where n is the number of finite-difference steps taken in the calculation. For the example of downward continuation in a laterally varying medium, the ideas of operator separation can be used to split the downward continuation operator into two parts, one that looks like the conventional downward-continuation operator for a stratified medium, and a second that represents the correction for the effects of lateral variation.
TL;DR: In this article, a general solution for the complex grassmannian non-linear sigma models in two euclidean dimensions in terms of holomorphic functions has been constructed, which is a simple generalization of the well-known CPN−1 model in two dimensions.
TL;DR: A stepwise procedure for obtaining the experimental structure for a particular experiment is presented together with rules for deriving the analysis-of-variance table from that structure.
Abstract: A stepwise procedure for obtaining the experimental structure for a particular experiment is presented together with rules for deriving the analysis-of-variance table from that structure. The procedure involves the division of the factors into groups and is essentially a generalization of the method of Nelder (1965, Proceedings of the Royal Society, Series A 283, 147-162; 1965, Proceedings of the Royal Society, Series A 283, 163-178), to what are termed 'multi-tiered' experiments. The proposed method is illustrated for a wine-tasting experiment.
TL;DR: The properties and possibilities of one-leg methods are presented in a manner that admits the generalization to smoothly varying step size and a new definition is given of the local truncation error and of the order of consistency.
Abstract: The properties and possibilities of one-leg methods are presented in a manner that admits the generalization to smoothly varying step size. A new definition is given of the local truncation error and of the order of consistency. Some data are given for the most accurate one-leg methods, i.e. for $p = k$ and $p = k + 1$, where p is the order of consistency and k is the step number of the method.
Book•
01 Jan 1983
TL;DR: In this article, a class Tk of analytic functions in the unit disc is defined in which the concept of close-to-convexity is generalized, and a necessary condition for a function f to belong to Tk, raduis of convexity problem and a coefficient result are solved.
Abstract: A class Tk of analytic functions in the unit disc is defined in which the concept of close-to-convexity is generalized. A necessary condition for a function f to belong to Tk, raduis of convexity problem and a coefficient result are solved in this paper.
TL;DR: The structures of symmetric submodular systems are examined, the theory is a generalization of the decomposition theory of 2-connected graphs developed by Tutte and can be applied to any (symmetric) sub modular systems.
TL;DR: The notion of self-decomposability for No-valued random variables was introduced by Steutel and van Harn [10] and its generalization by van Haren, Steuthel and Vervaat [11] were used to study the limiting behaviour of continuous-time Markov branching processes with immigration as mentioned in this paper.
Abstract: The notion of self-decomposability for No-valued random variables as introduced by Steutel and van Harn [10] and its generalization by van Harn, Steutel and Vervaat [5], are used to study the limiting behaviour of continuous-time Markov branching processes with immigration. This behaviour provides analogues to the behaviour of sequences of random variables obeying a certain difference equation as studied by Vervaat [12] and their continuous-time counterpart considered by Wolfe [13]. An application in queueing theory is indicated. Furthermore, discrete-state analogues are given for results on stability in the processes studied by Wolfe, and for results on self-decomposability in supercritical branching processes by Yamazato [14].
TL;DR: It is shown that for any reasonable generalization of chess to an NxN board, deciding for a given position which player has a winning strategy it is PSPACE-complete.
Proceedings Article•
08 Aug 1983TL;DR: A model of bias adjustment is presented and the experience with an implementation of the model is reported on.
Abstract: We approach concept learning as a heuristic search through a space of concepts for a concept that satisfies the learning task at hand The heuristics represent bias that the concept learning program employs when forming an inductive generalization. We present a model of bias adjustment and report our experience with an implementation of the model.
TL;DR: In this article, the asymptotic properties of a class of matched pairs tests based on powers of ranks are clarified and a generalization of this class of tests is described, raising a previously unanticipated concern about whether or not the analytic comparisons resulting from these tests correspond with an intuitive notion of what is being compared.
Abstract: Recent studies pertaining to an extended class of matched pairs tests based on powers of ranks are discussed. Previous questions regarding the asymptotic properties for this class of tests are clarified and a generalization of this class is described. This generalization raises a previously unanticipated concern about whether or not the analytic comparisons resulting from these tests correspond with an intuitive notion of what is being compared.