Vladik Kreinovich

Prof. Vladik Kreinovich

The University of Texas at El Paso, El Paso, Texas, USA
orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 January 2017 in International Journal of General Systems
Verified
Journal Article
Closed access
LHLukáš Havrlant
Lukáš Havrlant
VKVladik Kreinovich
Vladik Kreinovich
In document analysis, an important task is to automatically find keywords which best describe the subject of the document. One of the most widely used techniques for keyword detection is a technique based on the term frequency-inverse document frequency (tf-idf) heuristic. This techniques has some explanations, but these explanations are somewhat too complex to be fully convincing. In this paper, we provide a simple probabilistic explanation for the tf-idf heuristic. We also show that the ideas behind explanation can help us come up with more complex formulas which will hopefully lead to a more adequate detection of keywords.

18 November 2008 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
HNHung Nguyen
Hung Nguyen
OKOlga Kosheleva
Olga Kosheleva
VKVladik Kreinovich
Vladik Kreinovich
In 1951, K.J. Arrow proved that, under certain assumptions, it is impossible to have group decision-making rules that satisfy reasonable conditions like symmetry. This Impossibility Theorem is often cited as a proof that reasonable group decision-making is impossible. We start our article by remarking that Arrow's result covers only those situations when the only information we have about individual preferences is their binary preferences between the alternatives. If we follow the main ideas of modern decision making and game theory and also collect information about the preferences between lotteries (i.e., collect the utility values of different alternatives), then reasonable decision-making rules are possible, e.g., Nash's rule in which we select an alternative for which the product of utilities is the largest possible. We also deal with two related issues: how we can detect individual preferences if all we have is preferences of a subgroup and how we take into account the mutual attraction between participants.



6 March 2020
Verified
Book Chapter
Closed access
PDF file
VKVladik Kreinovich
Vladik Kreinovich
OKOlga Kosheleva
Olga Kosheleva
SSShahnaz N. Shahbazova
Shahnaz N. Shahbazova

1 June 2000 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
VKVladik Kreinovich
Vladik Kreinovich
HNHung Nguyen
Hung Nguyen
YYYeung Yam
Yeung Yam
One of the reasons why fuzzy methodology is successful is that fuzzy systems are universal approximators, i.e., we can approximate an arbitrary continuous function within any given accuracy by a fuzzy system. In some practical applications (e.g., in control), it is desirable to approximate not only the original function, but also its derivatives (so that, e.g., a fuzzy control approximating a smooth control will also be smooth). In our paper, we show that for any given accuracy, we can approximate an arbitrary smooth function by a fuzzy system so that not only the function is approximated within this accuracy, but its derivatives are approximated as well. In other words, we prove that fuzzy systems are universal approximators for smooth functions and their derivatives. ©2000 John Wiley & Sons, Inc.