K wie Kreis

Article for general public (2012)

K-Anonymity in Mobile Ad-Hoc Networks

Doctoral thesis (2010)

K-AP: Generating Specified K Clusters by Efficient Affinity Propagation

in ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining (2010)

The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers two major shortcomings: i) the ... [more ▼]

The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers two major shortcomings: i) the number of clusters is vague with the user-defined parameter called self-confidence, and ii) the quadratic computational complexity. When aiming at a given number of clusters due to prior knowledge, AP has to be launched many times until an appropriate setting of self-confidence is found. The re-launched AP increases the computational cost by one order of magnitude. In this paper, we propose an algorithm, called K-AP, to exploit the immediate results of K clusters by introducing a constraint in the process of message passing. Through theoretical analysis and experimental validation, K-AP was shown to be able to directly generate K clusters as user defined, with a negligible increase of computational cost compared to AP. In the meanwhile, KAP preserves the clustering quality as AP in terms of the distortion. K-AP is more effective than k-medoids w.r.t. the distortion minimization and higher clustering purity. [less ▲]

k-intolerant capacities and Choquet integrals

in European Journal of Operational Research (2007), 177(3), 1453-1468

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying ... [more ▼]

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation. We also introduce axiomatically indices to appraise the extent to which a given capacity is k-intolerant and we apply them on a particular recruiting problem. [less ▲]

k-intolerant capacities and Choquet integrals

in Klement, Erich Peter; Pap, Endre (Eds.) Proc. 25th Linz Seminar on Fuzzy Set Theory (LINZ 2004): Mathematics of Fuzzy Systems (2004, February)

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying ... [more ▼]

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation. [less ▲]

k-Metric antidimension: A privacy measure for social graphs

in Information Sciences (2016), 328

A k-segments algorithm for finding principal curves

in Pattern Recognition Letters (2002), 23(8), 1009-1017

We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines. New segments are inserted until a performance criterion is met. Experimental ... [more ▼]

We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines. New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches. [less ▲]

Kaapi / Charm++ preliminary comparison

Presentation (2010, June)

Kac-Rice formula for transverse intersections

in Analysis and Mathematical Physics (2022), 12

Kafka mit Crumb? Literarische Bildung im Spannungsverhältnis von Text und Bild

in Deutschunterricht (Der): Beiträge zu seiner Praxis und wissenschaftlichen Grundlegung (2009)