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


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
    • "These functions are known as quasi-concave set functions. Such a set function can be maximized by a greedy type algorithm over the family of all subsets of E [19],[24],[29],[30],[34], over antimatroids and convex geometries [17], [20], [25], joinsemilattices [28] and meet-semilattices [21]. A relationship was also established between submodular and quasi-concave functions [28] that allowed to build series of branch and bound procedures for finding maximum of submodular functions. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this article, we have investigated monotone linkage functions defined on convex geometries, antimatroids, and semilattices in general. It has been shown that the class of functions defined as minimum values of monotone linkage functions has close relationship with the class of quasi-concave set functions. Quasi-concave functions defined on semilattices, antimatroids and convex geometries determine special substructures of these set families. This structures allow building efficient algorithms that find minimal sets on which values of quasi-concave functions are maximum. The mutual critical step of these algorithms is how to describe the set closure operator. If an efficient algorithm of the closure construction exists it causes the optimization algorithm to be efficient as well. On the other hand, we think that the closure construction problem is interesting enough to be investigated separately. Thus, we suppose that for an arbitrary semilattice the problem of closure construction has exponential complexity. An interesting direction for future work is to develop our methods for relational databases, where a polynomial algorithm for closure construction is known [3]. We have considered some applications of quasi-concave functions to clustering a structured data set, where together with pair-wise similarities between objects, we are also given additional information about objects organization. We focused on a simple structure - a partition model of data where the objects are a priori partitioned into groups. While clustering such data, we also considered an additional requirement of being able to differentiate between pairwise similarities across different partite sets. Existing clustering methods do not solve this problem, since they are limited to finding clusters in a collection of isolated objects. The requirement of differentially treating pair-wise relationships across different groups was modeled by a multipartite graph along with a hierarchical relationship between these groups. The problem was reduced to finding the cluster (subgraph) of the highest density in the multipartite graph.
    Full-text · Chapter · Nov 2008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper incorporates into the design of taxes a utilitarian recommendation that the State should maximize “the guaranteed happiness†of individuals. In all our arguments relative to taxes we both characterize and evaluate the Nash bargaining solution. To reach an agreement, the welfare State actors, the social and public agencies, bargain over their shares of tax revenue. The social agency objective is an appropriate share of tax revenue financing agency expenditures on specific transfer payments – the social benefits. The public agency objective is its appropriate share financing the provision of public goods. We demonstrate that one might possibly find on the Pareto frontier a minimum tax sacrifice policy agreed to by more taxpayers than any other policy does.
    Full-text · Article · Jan 2001
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This article reports not only theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers or widely accepted classical Hamiltonian method of function maximization with constraints. Our motive is quite difficult to meet but we hope to move in this direction in order to close the gap at least for one nontrivial situation on Boolean Tables.
    Full-text · Article · Jan 2002 · SSRN Electronic Journal
Show more