Clones in Graphs

Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this approach is ineffective in data mining since real world data does not exhibit enough structural regularity. Here we step in with a novel approach based on mappings that preserve the maximal cliques. For this we exploit the well known correspondence between bipartite graphs and the data structure formal context $(G,M,I)$ from Formal Concept Analysis. From there we utilize the notion of clone items. The investigation of these is still an open problem to which we add new insights with this work. Furthermore, we produce a substantial experimental investigation of real world data. We conclude with demonstrating the generalization of clone items to permutations.Comment: 11 pages, 2 figures, 1 tabl

A coproduct structure on the formal affine Demazure algebra

In the present paper we generalize the coproduct structure on nil Hecke rings introduced and studied by Kostant-Kumar to the context of an arbitrary algebraic oriented cohomology theory and its associated formal group law. We then construct an algebraic model of the T-equivariant oriented cohomology of the variety of complete flags.Comment: 28 pages; minor revision of the previous versio

Empirical comparison of high gradient achievement for different metals in DC and pulsed mode

For the SwissFEL project, an advanced high gradient low emittance gun is under development. Reliable operation with an electric field, preferably above 125 MV/m at a 4 mm gap, in the presence of an UV laser beam, has to be achieved in a diode configuration in order to minimize the emittance dilution due to space charge effects. In the first phase, a DC breakdown test stand was used to test different metals with different preparation methods at voltages up to 100 kV. In addition high gradient stability tests were also carried out over several days in order to prove reliable spark-free operation with a minimum dark current. In the second phase, electrodes with selected materials were installed in the 250 ns FWHM, 500 kV electron gun and tested for high gradient breakdown and for quantum efficiency using an ultra-violet laser.Comment: 25 pages, 13 figures, 5 tables. Follow up from FEL 2008 conference (Geyongju Korea 2008) New Title in JVST A (2010) : Vacuum breakdown limit and quantum efficiency obtained for various technical metals using DC and pulsed voltage source

Towards semantic web mining

Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. The idea is to improve, on the one hand, the results of Web Mining by exploiting the new semantic structures in the Web; and to make use of Web Mining, on the other hand, for building up the Semantic Web. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable

On the high-density expansion for Euclidean Random Matrices

Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different formulations of the mathematical problem and are shown to give identical results up to second order in the perturbative expansion. One method, based on writing the so-called resolvent function as a Taylor series, allows to group the diagrams in a small number of topological classes, providing a simple way to determine the infrared (small momenta) behavior of the theory up to third order, which is of interest for the comparison with experiments. The other method, which reformulates the problem as a field theory, can instead be used to study the infrared behaviour at any perturbative order.Comment: 29 page

DEvIANT: Discovering Significant Exceptional (Dis-)Agreement Within Groups

We strive to find contexts (i.e., subgroups of entities) under which exceptional (dis-)agreement occurs among a group of individuals , in any type of data featuring individuals (e.g., parliamentarians , customers) performing observable actions (e.g., votes, ratings) on entities (e.g., legislative procedures, movies). To this end, we introduce the problem of discovering statistically significant exceptional contextual intra-group agreement patterns. To handle the sparsity inherent to voting and rating data, we use Krippendorff's Alpha measure for assessing the agreement among individuals. We devise a branch-and-bound algorithm , named DEvIANT, to discover such patterns. DEvIANT exploits both closure operators and tight optimistic estimates. We derive analytic approximations for the confidence intervals (CIs) associated with patterns for a computationally efficient significance assessment. We prove that these approximate CIs are nested along specialization of patterns. This allows to incorporate pruning properties in DEvIANT to quickly discard non-significant patterns. Empirical study on several datasets demonstrates the efficiency and the usefulness of DEvIANT. Technical Report Associated with the ECML/PKDD 2019 Paper entitled: "DEvIANT: Discovering Significant Exceptional (Dis-)Agreement Within Groups"

Getting the phase consistent: The importance of phase description in balanced steady-state free precession MRI of multicompartment systems

Purpose: Determine the correct mathematical phase description for balanced steady-state free precession (bSSFP) signals in multicompartment systems. Theory and Methods: Based on published bSSFP signal models, two distinct phase descriptions can be formulated: one predicting the presence and the other predicting the absence of destructive interference effects in multicompartment systems. Numerical simulations of bSSFP signals of water and acetone were performed to evaluate the predictions of these two distinct phase descriptions. For experimental validation, bSSFP profiles were measured at 3T using phase-cycled bSSFP acquisitions performed in a phantom containing mixtures of water and acetone, which replicates a system with two signal components. Localized single voxel MRS was performed at 7T to determine the relative chemical-shift of the acetone-water mixtures. Results: Based on the choice of phase description, the simulated bSSFP profiles of water-acetone mixtures varied significantly, either displaying or lacking destructive interference effects, as predicted theoretically. In phantom experiments, destructive interference was consistently observed in the measured bSSFP profiles of water-acetone mixtures, an observation which excludes the phase description that predicts an absence of destructive interference. The connection between the choice of phase description and predicted observation enables an unambiguous experimental identification of the correct phase description for multicompartment bSSFP profiles, which is consistent with Bloch equations. Conclusion: The study emphasizes that consistent phase descriptions are crucial for accurately describing multi-compartment bSSFP signals, as incorrect phase descriptions result in erroneous predictions.Comment: Submitted to Magn. Reson. Me

Detecting Features from Confusion Matrices using Generalized Formal Concept Analysis

We claim that the confusion matrices of multiclass problems can be analyzed by means of a generalization of Formal Concept Analysis to obtain symbolic information about the feature sets of the underlying classification task.We prove our claims by analyzing the confusion matrices of human speech perception experiments and comparing our results to those elicited by experts.This work has been supported by Spanish Government-Comisión Interministerial de Ciencia y Tecnología TEC2008-02473/TEC y TEC2008-06382/TEC.Publicad

On Coupling FCA and MDL in Pattern Mining

International audiencePattern Mining is a well-studied field in Data Mining and Machine Learning. The modern methods are based on dynamically updating models, among which MDL-based ones ensure high-quality pattern sets. Formal concepts also characterize patterns in a condensed form. In this paper we study MDL-based algorithm called Krimp in FCA settings and propose a modified version that benefits from FCA and relies on probabilistic assumptions that underlie MDL. We provide an experimental proof that the proposed approach improves quality of pattern sets generated by Krimp

On the homomorphism order of labeled posets

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism order of k-posets. Sublattices are also examined.Comment: 14 page