A Fast Algorithm for Finding Matching Responses in a Survey Data Table

Byrej 269, 2650 Hvidovre, Copenhagen, Denmark
Mathematical Social Sciences (Impact Factor: 0.46). 03/1995; 30:195-205. DOI: 10.1016/0165-4896(95)00780-P
Source: CiteSeer

ABSTRACT The paper addresses an algorithm to perform an analysis on survey data tables with some irreliable entries. The algorithm has almost linear complexity depending on the number of elements in the table. The proposed technique is based on a monotonicity property. An implementation procedure of the algorithm contains a recommendation that might be realistic for clarifying the analysis results. Keywords: Survey; Boolean; Data Table; Matrix. 1.

Download full-text


Available from: Joseph Emmanuel Mullat, Feb 05, 2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The study addresses important issues relating to computational aspects of coalition formation. However, finding payoffs -- imputations belonging to the core -- is, while almost as well known, an overly complex, NP-hard problem, even for modern supercomputers. The issue becomes uncertain because, among other issues, it is unknown whether the core is non-empty. In the proposed cooperative game, under the name of singles, the presence of non-empty collections of outcomes (payoffs) similar to the core (say quasi-core) is fully guaranteed. Quasi-core is defined as a collection of coalitions minimal by inclusion among non-dominant coalitions induced through payoffs similar to super-modular characteristic functions (Shapley, 1971). As claimed, the quasi-core is identified via a version of P-NP problem that utilizes the branch and bound heuristic and the results are visualized by Excel spreadsheet.
    The Seventh International Conference Game Theory and Management, St. Petersburg, Russia; 06/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The note addresses a principle of data cleaning. An implementation procedure of the principle contains a recommendation that might be well suited for clarifying and illustrating the results of survey data analysis.
    Informatik og Matematisk Modellering Danmark Tekniske Universitet; 07/2009
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper deals with maximization of set functions defined as minimum values of monotone linkage functions. In previous research, it has been shown that such a set function can be maximized by a greedy type algorithm over a family of all subsets of a finite set. In this paper, we extend this finding to meet-semilattices.We show that the class of functions defined as minimum values of monotone linkage functions coincides with the class of quasi-concave set functions. Quasi-concave functions determine a chain of upper level sets each of which is a meet-semilattice. This structure allows development of a polynomial algorithm that finds a minimal set on which the value of a quasi-concave function is maximum. One of the critical steps of this algorithm is a set closure. Some examples of closure computation, in particular, a closure operator for convex geometries, are considered.
    Discrete Applied Mathematics 02/2008; 156(4-156):492-499. DOI:10.1016/j.dam.2006.12.005 · 0.68 Impact Factor