52 search results - page 2 / 11 » Probabilistic dyadic data analysis with local and global con... |
NIPS
2001
13 years 6 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
JITECH
2010
13 years 3 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
In this paper, the computation of likelihood of block motion candidates is considered. The method is based on the evaluation of the sum of squared differences (SSD) measure for lo...