Sciweavers

93 search results - page 2 / 19
» Random Iteration Algorithm for Graph-Directed Sets
Sort
View
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 7 months ago
Computations of probabilistic output admissible set for uncertain constrained systems
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
Takeshi Hatanaka, Kiyotsugu Takaba
IADIS
2008
13 years 9 months ago
Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
Neelima Gupta, Seema Aggarwal
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ICML
2010
IEEE
13 years 8 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...