TITLE

Partitions of Partitions

AUTHOR(S)
Gordon, A.D.; Vichi, M.
PUB. DATE
August 1998
SOURCE
Journal of Classification;1998, Vol. 15 Issue 2, p265
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Abstract: The paper presents methodology for analyzing a set of partitions of the same set of objects, by dividing them into classes of partitions that are similar to one another. Two different definitions are given for the consensus partition which summarizes each class of partitions. The classes are obtained using either constrained or unconstrained clustering algorithms. Two applications of the methodology are described.
ACCESSION #
4676424

 

Related Articles

  • A Constructive Enumeration of Meanders. Franz, Reinhard O.W.; Earnshaw, Berton A. // Annals of Combinatorics;2002, Vol. 6 Issue 1, p7 

    We present an efficient algorithm for the construction of plane meanders. All known construction algorithms seem to be of exponential complexity. We use the description of meanders in terms of pairs of noncrossing partitions as introduced in [4].

  • Stability in coalition formation games. Cechlárová, Katarı´na; Romero-Medina, Antonio // International Journal of Game Theory;2001, Vol. 29 Issue 4, p487 

    Abstract. In the context of coalition formation games a player evaluates a partition on the basis of the set she belongs to. For this evaluation to be possible, players are supposed to have preferences over sets to which they could belong. In this paper, we suggest two extensions of preferences...

  • Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms. Sergeyev, Ya. D. // Journal of Optimization Theory & Applications;Feb2005, Vol. 124 Issue 2, p503 

    In this paper, the problem of the minimal description of the structure of a vector function f(x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered....

  • q-Painlev� VI Equation Arising from q-UC Hierarchy. Tsuda, Teruhisa; Masuda, Tetsu // Communications in Mathematical Physics;Mar2006, Vol. 262 Issue 3, p595 

    We study the q-difference analogue of the sixth Painlev� equation ( q- P VI) by means of tau functions associated with the affine Weyl group of type D 5. We prove that a solution of q- P VI coincides with a self-similar solution of the q-UC hierarchy. As a consequence, we obtain in...

  • Graphs with Metric Dimension Two- A Characterization. Sudhakara, G.; Hemanth, Kumar A. R. // World Academy of Science, Engineering & Technology;Dec2009, Issue 36, p621 

    In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric...

  • Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional. E. Kiselyova; M. Dunaichuk // Cybernetics & Systems Analysis;Mar2008, Vol. 44 Issue 2, p261 

    Abstract  A continuous nonlinear single-commodity problem of optimal partition of a set Ω in an n-measurable Euclidean space into disjoint subsets with arrangement of their centers is analyzed using equality and inequality constraints in the case of a convex objective functional. A...

  • Placement of K Disjoint Isothetic Unit Squares to Maximize Points Containment. Mahapatra, Priya Ranjan Sinha // International Journal of Advanced Research in Computer Science;May2011, Vol. 2 Issue 3, p239 

    Given a set P of n points in the two dimensional plane, we propose O (k²n5 time and O(kn4 space algorithm to locate k isothetic unit squares which are pair wise disjoint and they together contain maximum number of points from P . Moreover, an O(² log n) time and O(n) space algorithm is...

  • HEURISTIC ALGORITHMS FOR SOLVING THE BI-DIMENSIONAL TWO-WAY NUMBER PARTITIONING PROBLEM. FUKSZ, LEVENTE; POP, PETRICA; ZELINA, IOANA // Studia Universitatis Babes-Bolyai, Informatica;Sep2013, Vol. 58 Issue 3, p17 

    The bi-dimensional two-way number partitioning problem is a generalization of the classical number partitioning problem, where instead of a set of integers we have a set of vectors of dimension 2 that have to be divided into two subsets so that the sums of the vectors in the subsets are equal or...

  • A Clustering Criterion Based on Distortion Ratios and Its Algorithms. Morii, Fujiki // GSTF Journal on Computing;Apr2012, Vol. 2 Issue 1, p49 

    A clustering criterion based on distortion ratios and its algorithms are proposed without offering the knowledge of the number of clusters. Computing distortion ratios on splitting and distortion ratios on merging for clusters of a data set, the criterion function is defined as the mean of the...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics