Filters

Settings

Now showing1 - 2 of 2
  • Some of the metrics are blocked by your 
    consent settings
    Item type:Publication, Access status: without files ,
    An information theory based approach to multisource clustering
    (2018-07)
    Murena, Pierre Alexandre
    ;
    Sublime, Jérémie
    ;
    Matei, Basarab
    ;
    Cornuéjols, Antoine
    Clustering is a compression task which consists in grouping similar objects into clusters. In real-life applications, the system may have access to several views of the same data and each view may be processed by a specific clustering algorithm: this framework is called multi-view clustering and can benefit from algorithms capable of exchanging information between the different views. In this paper, we consider this type of unsupervised ensemble learning as a compression problem and develop a theoretical framework based on algorithmic theory of information suitable for multi-view clustering and collaborative clustering applications. Using this approach, we propose a new algorithm based on solid theoretical basis, and test it on several real and artificial data sets.
    Publicationtype: Conference Paper
      20
  • Some of the metrics are blocked by your 
    consent settings
    Item type:Publication, Access status: without files ,
    Classification transfer for qualitative reasoning problems
    (2018-07)
    Bodirsky, Manuel
    ;
    Jonsson, Peter
    ;
    Martin, Barnaby
    ;
    Mottet, Antoine
    We study formalisms for temporal and spatial reasoning in the modern, algebraic and model-theoretic, context of infinite-domain Constraint Satisfaction Problems (CSPs). We show how questions on the complexity of their subclasses can be solved using existing results via the powerful use of primitive positive (pp) interpretations and pp-homotopy. We demonstrate the methodology by giving a full complexity classification of all constraint languages that are first-order definable in Allen's Interval Algebra and contain the basic relations (s) and (f). In the case of the Rectangle Algebra we answer in the affirmative the old open question as to whether ORD-Horn is a maximally tractable subset among the (disjunctive, binary) relations. We then generalise our results for the Rectangle Algebra to the r-dimensional Block Algebra.
    Publicationtype: Conference Paper
      20