966 resultados para Weighted shift
Resumo:
Mathematics Subject Classification: 26D10.
Resumo:
2000 Math. Subject Classification: Primary 42B20, 42B25, 42B35
Resumo:
Mathematics Subject Classification: Primary 42B20, 42B25, 42B35
Resumo:
This study surveys the ordered weighted averaging (OWA) operator literature using a citation network analysis. The main goals are the historical reconstruction of scientific development of the OWA field, the identification of the dominant direction of knowledge accumulation that emerged since the publication of the first OWA paper, and to discover the most active lines of research. The results suggest, as expected, that Yager's paper (IEEE Trans. Systems Man Cybernet, 18(1), 183-190, 1988) is the most influential paper and the starting point of all other research using OWA. Starting from his contribution, other lines of research developed and we describe them.
Resumo:
MSC 2010: 26A33
Resumo:
ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2.
Resumo:
Павел Т. Стойнов - В тази работа се разглежда отрицателно биномното разпределение, известно още като разпределение на Пойа. Предполагаме, че смесващото разпределение е претеглено гама разпределение. Изведени са вероятностите в някои частни случаи. Дадени са рекурентните формули на Панжер.
Resumo:
In this paper, we develop a new entropic matching kernel for weighted graphs by aligning depth-based representations. We demonstrate that this kernel can be seen as an aligned subtree kernel that incorporates explicit subtree correspondences, and thus addresses the drawback of neglecting the relative locations between substructures that arises in the R-convolution kernels. Experiments on standard datasets demonstrate that our kernel can easily outperform state-of-the-art graph kernels in terms of classification accuracy.
Resumo:
Sequential pattern mining is an important subject in data mining with broad applications in many different areas. However, previous sequential mining algorithms mostly aimed to calculate the number of occurrences (the support) without regard to the degree of importance of different data items. In this paper, we propose to explore the search space of subsequences with normalized weights. We are not only interested in the number of occurrences of the sequences (supports of sequences), but also concerned about importance of sequences (weights). When generating subsequence candidates we use both the support and the weight of the candidates while maintaining the downward closure property of these patterns which allows to accelerate the process of candidate generation.
Resumo:
2010 Mathematics Subject Classification: 94A17.
Resumo:
2000 Mathematics Subject Classification: 46B70, 41A25, 41A17, 26D10. ∗Part of the results were reported at the Conference “Pioneers of Bulgarian Mathematics”, Sofia, 2006.
Resumo:
2000 Mathematics Subject Classification: 35S05.
Resumo:
2000 Mathematics Subject Classification: 35L15, 35B40, 47F05.
Resumo:
2000 Mathematics Subject Classification: 35P20, 35J10, 35Q40.
Resumo:
2000 Mathematics Subject Classification: 42A45.