Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

(K)eine 10 für eine 5 oder vom Einfall des Staunens. Leçon du cycle « (uni.lu)10 » donnée le 11 mars 2014 avec une introduction de Massimo Malvetti Heimböckel, Dieter Book published by Metaxy (2016) Detailed reference viewed: 91 (3 UL)K-Anonymity in Mobile Ad-Hoc Networks Spiewak, Dagmara Doctoral thesis (2010) Detailed reference viewed: 65 (4 UL)k-anonymous Reputation ; Schiffner, Stefan ; in Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security (2013) Detailed reference viewed: 43 (1 UL)K-AP: Generating Specified K Clusters by Efficient Affinity Propagation ; Wang, Wei ; 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: 87 (1 UL)k-intolerant bi-capacities and veto criteria ; ; Marichal, Jean-Luc 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: 126 (0 UL)k-intolerant capacities and Choquet integrals Marichal, Jean-Luc 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: 111 (3 UL)k-intolerant capacities and Choquet integrals Marichal, Jean-Luc 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: 101 (9 UL)k-intolerant capacities and Choquet integrals Marichal, Jean-Luc 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: 117 (1 UL)k-intolerant capacities and Choquet integrals Marichal, Jean-Luc 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 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: 87 (0 UL)k-Metric antidimension: A privacy measure for social graphs Trujillo Rasua, Rolando ; in Information Sciences (2016), 328 Detailed reference viewed: 67 (0 UL)k-Metric Antidimension: a Privacy Measure for Social Graphs Trujillo Rasua, Rolando ; in Information Sciences (2015), 328 Detailed reference viewed: 111 (6 UL)A k-segments algorithm for finding principal curves ; Vlassis, Nikos ; 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: 179 (0 UL)K-Sorting with multiple ordinal criteria Bisdorff, Raymond Scientific Conference (2011, February 10) Detailed reference viewed: 37 (0 UL)Kaapi / Charm++ preliminary comparison Besseron, Xavier ; ; et al Presentation (2010, June) Detailed reference viewed: 18 (2 UL)Kaapi: A Thread Scheduling Runtime System for Data Flow Computations on Cluster of Multi-Processors ; Besseron, Xavier ; in PASCO '07 Proceedings of the 2007 international workshop on Parallel symbolic computation (2007, July) Detailed reference viewed: 50 (2 UL)Kafka mit Crumb? Literarische Bildung im Spannungsverhältnis von Text und Bild Mein, Georg in Deutschunterricht (Der) (2009) Detailed reference viewed: 75 (0 UL)Der Kaiser bestimmt! Alanus ab Insulis‘ Anticlaudianus und Heinrichs von Mügeln Der Meide Kranz Bendheim, Amelie in Bendheim, Amelie; Sieburg, Heinz (Eds.) Prag in der Zeit der Luxemburger Dynastie. Literatur, Religion und Herrschaftskulturen zwischen Bereicherung und Behauptung (2018) Detailed reference viewed: 51 (0 UL)Der Kaiser und der Königsmacher. Trierer Bausteine einer Luxemburger memoria Margue, Michel in Margue, Michel; Pauly, Michel; Schmid, Wolfgang (Eds.) Der Weg zur Kaiserkrone. Der Romzug Heinrichs VII. in der Darstellung Erzbischof Balduins von Trier (2009) Detailed reference viewed: 31 (0 UL) |
||