Sciweavers

581 search results - page 23 / 117
» EM in High Dimensional Spaces
Sort
View
DAWAK
1999
Springer
15 years 2 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
UAI
2000
14 years 12 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
ACISP
1997
Springer
15 years 2 months ago
New Lower Bounds on Nonlinearity and a Class of Highly Nonlinear Functions
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
Xian-Mo Zhang, Yuliang Zheng
NN
2010
Springer
183views Neural Networks» more  NN 2010»
14 years 9 months ago
Dimensionality reduction for density ratio estimation in high-dimensional spaces
The ratio of two probability density functions is becoming a quantity of interest these days in the machine learning and data mining communities since it can be used for various d...
Masashi Sugiyama, Motoaki Kawanabe, Pui Ling Chui
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 5 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan