From post

Aggregation on a Cartesian Product of Bounded Partially Ordered Sets.

, и . IPMU (1), том 1601 из Communications in Computer and Information Science, стр. 3-10. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Aggregation Theory Revisited., и . IEEE Trans. Fuzzy Syst., 29 (4): 797-804 (2021)On the Role of the Considered Measure in a Quantile-Based Graded Version of Stochastic Dominance., и . IPMU (2), том 1602 из Communications in Computer and Information Science, стр. 483-493. Springer, (2022)Monotonicity of a Profile of Rankings with Ties., , , и . IPMU (2), том 854 из Communications in Computer and Information Science, стр. 313-322. Springer, (2018)The acclamation consensus state and an associated ranking rule., и . Int. J. Intell. Syst., 34 (6): 1223-1247 (2019)The Borda Count as a Tool for Reducing the Influence of the Distance Function on kmeans., , и . HAIS, том 12344 из Lecture Notes in Computer Science, стр. 450-461. Springer, (2020)Ordering finitely generated sets and finite interval-valued hesitant fuzzy sets., , , , , и . Inf. Sci., (2015)Penalty-Based Aggregation Beyond the Current Confinement to Real Numbers: The Method of Kemeny Revisited., и . EUSFLAT/IWIFSGN (3), том 643 из Advances in Intelligent Systems and Computing, стр. 171-180. Springer, (2017)Clonal sets of a binary relation., , , и . Int. J. General Systems, 47 (4): 329-349 (2018)Machine Learning Methods for Ordinal Classification with Additional Relative Information., , и . BNAIC/BENELEARN (Selected Papers), том 1196 из Communications in Computer and Information Science, стр. 126-136. Springer, (2019)The Median Procedure as an Example of Penalty-Based Aggregation of Binary Relations., и . IPMU (2), том 854 из Communications in Computer and Information Science, стр. 359-366. Springer, (2018)