Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
See detailK wie Kreis
Heimböckel, Dieter UL

Article for general public (2012)

Detailed reference viewed: 19 (0 UL)
See detailK-Anonymity in Mobile Ad-Hoc Networks
Spiewak, Dagmara UL

Doctoral thesis (2010)

Detailed reference viewed: 37 (4 UL)
Full Text
See detailK-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Zhang, Xiangliang; Wang, Wei UL; Nørvåg, Kjetil et al

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 ▲]

Detailed reference viewed: 28 (1 UL)
Full Text
Peer Reviewed
See detailk-intolerant bi-capacities and veto criteria
Grabisch, Michel; Labreuche, Christophe; Marichal, Jean-Luc UL et al

in López-Díaz, Miguel Concepcion; Gil, Maria Angeles; Grzegorzewski, Przemyslaw (Eds.) et al Soft Methodology and Random Information Systems (2004, July 30)

We present the notion of k-intolerant bi-capacity, extending to the case of bipolar scales the notion of k-intolerant capacity recently proposed by Marichal. In a second part, we extend to the bipolar ... [more ▼]

We present the notion of k-intolerant bi-capacity, extending to the case of bipolar scales the notion of k-intolerant capacity recently proposed by Marichal. In a second part, we extend to the bipolar case the notion of veto criteria. [less ▲]

Detailed reference viewed: 43 (0 UL)
Full Text
Peer Reviewed
See detailk-intolerant capacities and Choquet integrals
Marichal, Jean-Luc UL

in Proc. 10th Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2004), Perugia, Italy, July 4-9, 2004 (2004, July)

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. [less ▲]

Detailed reference viewed: 10 (0 UL)
Full Text
Peer Reviewed
See detailk-intolerant capacities and Choquet integrals
Marichal, Jean-Luc UL

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 ▲]

Detailed reference viewed: 18 (1 UL)
Full Text
Peer Reviewed
See detailk-intolerant capacities and Choquet integrals
Marichal, Jean-Luc UL

in Barthélemy, Jean-Pierre; Lenca, Philippe (Eds.) Advances in Multicriteria Decision Aid - Progrès en Aide Multicritère à la Décision (ENST Bretagne, 2005) (2005)

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 ▲]

Detailed reference viewed: 34 (8 UL)
Full Text
Peer Reviewed
See detailk-intolerant capacities and Choquet integrals
Marichal, Jean-Luc UL

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 ▲]

Detailed reference viewed: 31 (3 UL)
Full Text
Peer Reviewed
See detailk-Metric Antidimension: a Privacy Measure for Social Graphs
Trujillo Rasua, Rolando UL; Yero, Ismael G.

in Information Sciences (2015), 328

Detailed reference viewed: 35 (4 UL)
Full Text
Peer Reviewed
See detailA k-segments algorithm for finding principal curves
Verbeek, J. J.; Vlassis, Nikos UL; Kröse, B.

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 ▲]

Detailed reference viewed: 14 (0 UL)
Full Text
Peer Reviewed
See detailK-Sorting with multiple ordinal criteria
Bisdorff, Raymond UL

Scientific Conference (2011, February 10)

Detailed reference viewed: 13 (0 UL)
Full Text
See detailK. Schmidt/Lutter, AktG, 3. Auflage, Buchbesprechung
Zetzsche, Dirk Andreas UL

in AktG, 3. Auflage, Buchbesprechung (2016)

Detailed reference viewed: 18 (1 UL)
See detailKafka mit Crumb? Literarische Bildung im Spannungsverhältnis von Text und Bild
Mein, Georg UL

in Deutschunterricht (Der) (2009)

Detailed reference viewed: 35 (0 UL)
Peer Reviewed
See detailKalium-Restriktion und essentielle Hypertonie
Neyses, Ludwig UL

in Deutsche Medizinische Wochenschrift (1946) (1991), (116), 2417-2248

Detailed reference viewed: 24 (0 UL)
See detailKampf gegen Schweiß und Körpergeruch. Männer der unteren Klasse.
Rothmüller, Barbara UL

in Penz, Otto (Ed.) Schönheit als Praxis. Über klassen- und geschlechtsspezifische Körperlichkeit (2010)

Detailed reference viewed: 64 (1 UL)
See detailKann das baro-afferente Feedback-Signal klassisch konditioniert werden?
Stertz, A. M.; Schulz, André UL; Schilling, T. et al

in Widmann, A.; Andersen, S. K.; Friederici, A. D. (Eds.) et al 35. Arbeitstagung Psychophysiologie und Methodik (2009)

Detailed reference viewed: 13 (3 UL)
See detailKann der Ausbau der institutionellen Tagesbetreuung das Vereinbarkeitsproblem lösen? Rückfragen an den familienpolitischen Konsens
Honig, Michael-Sebastian UL

in Lettke, Frank; Lange, Andreas (Eds.) Generationen und Familien. Analysen – Konzepte – gesellschaftliche Spannungsfelder (2007)

Detailed reference viewed: 20 (1 UL)
Peer Reviewed
See detailKann Erkenntnis kreativ sein? Die produktive Einbildungskraft in der Erkenntnistheorie und Ästhetik Kants
Heidemann, Dietmar UL

in Akten des XX. Deutschen Kongress für Philosophie (2005)

Detailed reference viewed: 40 (0 UL)
Full Text
Peer Reviewed
See detailKann man Kultur digitalisieren?
Dembeck, Till UL

in Weimarer Beiträge (2010), (3), 421431

Detailed reference viewed: 30 (1 UL)