Sciweavers

1419 search results - page 207 / 284
» A Characterization of Constructive Dimension
Sort
View
ICPP
2000
IEEE
15 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
15 years 10 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
AAAI
2006
15 years 7 months ago
Tensor Embedding Methods
Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various machine learning and pattern classification tasks...
Guang Dai, Dit-Yan Yeung
IJCAI
1989
15 years 7 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
GRC
2010
IEEE
15 years 7 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi