Browsing Scientific Publications in Information and Communication Technology by Author "Oommen, B. John"
Now showing items 1-20 of 51
-
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
Zhang, Xuan; Granmo, Ole-Christoffer; Oommen, B. John; Jiao, Lei (Journal article; Peer reviewed, 2014)The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, ... -
A hierarchical learning scheme for solving the Stochastic Point Location problem
Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John; Goodwin, Morten (Lecture Notes in Computer Science;7345, Chapter; Peer reviewed, 2012)This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task ... -
A new frontier in novelty detection : Pattern recognition of stochastically episodic events
Bellinger, Colin; Oommen, B. John (Lecture Notes in Computer Science; no. 6591, Chapter; Peer reviewed, 2011)A particularly challenging class of PR problems in which the, generally required, representative set of data drawn from the second class is unavailable, has recently received much consideration under the guise of One-Class ... -
A new paradigm for pattern classification: Nearest Border Techniques
Li, Yifeng; Oommen, B. John; Ngom, Alioune; Rueda, Luis (Lecture Notes in Computer Science;8272, Chapter; Peer reviewed, 2013)There are many paradigms for pattern classification. As opposed to these, this paper introduces a paradigm that has not been reported in the literature earlier, which we shall refer to as the Nearest Border (NB) paradigm. ... -
A novel Border Identification algorithm based on an “Anti-Bayesian” paradigm
Thomas, Anu; Oommen, B. John (Lecture Notes in Computer Science;8047, Chapter; Peer reviewed, 2013)Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the ... -
A Stochastic Search on the Line-Based Solution to Discretized Estimation
Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John (Lecture Notes in Computer Science;7345, Chapter; Peer reviewed, 2012)Recently, Oommen and Rueda [11] presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the ... -
A user-centric approach for personalized service provisioning in pervasive environments
Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John; Gerdes, Martin; Reichert, Frank (Journal article; Peer reviewed, 2011)The vision of pervasive environments is being realized more than ever with the proliferation of services and computing resources located in our surrounding environments. Identifying those services that deserve the attention ... -
Achieving Fair Load Balancing by Invoking a Learning Automata-based Two Time Scale Separation Paradigm
Yazidi, Anis; Hassan, Ismail; Hammer, Hugo Lewi; Oommen, B. John (Journal article; Peer reviewed, 2020)In this article, we consider the problem of load balancing (LB), but, unlike the approaches that have been proposed earlier, we attempt to resolve the problem in a fair manner (or rather, it would probably be more appropriate ... -
An adaptive approach to learning the preferences of users in a social network using weak estimators
Oommen, B. John; Yazidi, Anis; Granmo, Ole-Christoffer (Journal article; Peer reviewed, 2012)Since a social network by definition is so diverse, the problem of estimating the preferences of its users is becoming increasingly essential for personalized applications, which range from service recommender systems to ... -
An intelligent architecture for service provisioning in pervasive environments
Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John; Reichert, Frank; Gerdes, Martin (Chapter; Peer reviewed, 2011)The vision of pervasive environments is being realized more than ever with the proliferation of services and computing resources located in our surrounding environments. Identifying those services that deserve the attention ... -
Anomaly detection in dynamic systems using weak estimators
Zhan, Justin; Oommen, B. John; Crisostomo, Johanna (Journal article; Peer reviewed, 2011)Anomaly detection involves identifying observations that deviate from the normal behavior of a system. One of the ways to achieve this is by identifying the phenomena that characterize “normal” observations. Subsequently, based ... -
"Anti-Bayesian" parametric pattern classification using order statistics criteria for some members of the exponential family
Oommen, B. John; Thomas, A. (Journal article; Peer reviewed, 2013)This paper submits a comprehensive report of the use of order statistics (OS) for parametric pattern recognition (PR) for various distributions within the exponential family. Although the field of parametric PR has been ... -
Discretized Bayesian pursuit – A new scheme for reinforcement learning
Zhang, Xuan; Granmo, Ole-Christoffer; Oommen, B. John (Lecture Notes in Computer Science;7345, Chapter; Peer reviewed, 2012)The success of Learning Automata (LA)-based estimator algorithms over the classical, Linear Reward-Inaction ( L RI )-like schemes, can be explained by their ability to pursue the actions with the highest reward probability ... -
Fault-tolerant routing in adversarial mobile ad hoc networks: an efficient route estimation scheme for non-stationary environments
Oommen, B. John; Misra, Sudip (Journal article; Peer reviewed, 2010)Designing routing schemes that would successfully operate in the presence of adversarial environments in Mobile Ad Hoc Networks (MANETs) is a challenging issue. In this paper, we discuss fault-tolerant routing schemes ... -
Generalized Bayesian pursuit: A novel scheme for multi-armed Bernoulli bandit problems
Zhang, Xuan; Oommen, B. John; Granmo, Ole-Christoffer (IFIP Advances in Information and Communication Technology;364, Chapter; Peer reviewed, 2011)In the last decades, a myriad of approaches to the multi-armed bandit problem have appeared in several different fields. The current top performing algorithms from the field of Learning Automata reside in the Pursuit family, ... -
Ideal Chaotic Pattern Recognition is achievable: The Ideal-M-AdNN - its design and properties
Qin, Ke; Oommen, B. John (Lecture Notes in Computer Science;8065, Chapter; Peer reviewed, 2013)This paper deals with the relatively new field of designing a Chaotic Pattern Recognition (PR) system. The benchmark of such a system is the following: First of all, one must be able to train the system with a set of ... -
Imposing tree-based topologies onto self organizing maps
Astudillo, César A.; Oommen, B. John (Journal article; Peer reviewed, 2011)The beauty of the Kohonen map is that it has the property of organizing the codebook vectors, which represent the data points, both with respect to the underlying distribution and topologically. This topology is traditionally ... -
Language Detection and Tracking in Multilingual Documents Using Weak Estimators
Stensby, Aleksander; Oommen, B. John; Granmo, Ole-Christoffer (Chapter; Peer reviewed, 2010)This paper deals with the extremely complicated problem of language detection and tracking in real-life electronic (for example, in Word-of-Mouth (WoM)) applications, where various segments of the text are written in ... -
A Learning Automata Based Solution to Service Selection in Stochastic Environments
Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John (Chapter; Peer reviewed, 2010)With the abundance of services available in today’s world, identifying those of high quality is becoming increasingly difficult. Reputation systems can offer generic recommendations by aggregating user provided opinions ... -
Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
Granmo, Ole-Christoffer; Oommen, B. John (Journal article; Peer reviewed, 2011)We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In ...