Sciweavers

1722 search results - page 86 / 345
» Variables in Concept Graphs
Sort
View
MOR
2008
81views more  MOR 2008»
14 years 9 months ago
Risk Tuning with Generalized Linear Regression
A framework is set up in which linear regression, as a way of approximating a random variable by other random variables, can be carried out in a variety of ways, which moreover ca...
R. Tyrrell Rockafellar, Stan Uryasev, Michael Zaba...
DAC
1999
ACM
15 years 10 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
UAI
2004
14 years 11 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 3 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
15 years 3 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang