Sciweavers

1640 search results - page 94 / 328
» Conditional Independence Trees
Sort
View
156
Voted
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 3 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 3 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
ICASSP
2008
IEEE
15 years 10 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali
KI
1997
Springer
15 years 7 months ago
Agents in Proactive Environments
Abstract. Agents situated in proactive environments are acting autonomously while the environment is evolving alongside, whether or not the agents carry out any particular actions....
Dov M. Gabbay, Rolf Nossum, Michael Thielscher
ALT
1995
Springer
15 years 7 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara