1051 search results - page 108 / 211 » An algorithm for the principal component analysis of large d... |
114
Voted
SAC
2008
ACM
15 years 4 months ago
2008
ACM
This paper describes experiments concerned with the automatic analysis of emotions in text. We describe the construction of a large data set annotated for six basic emotions: ange...
177
click to vote
BCS
2008
15 years 6 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
131
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
153
click to vote
CIKM
1997
Springer
15 years 9 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
127
Voted
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...