1836 search results - page 328 / 368 » Mining Clustering Dimensions |
IV
2005
IEEE
14 years 2 months ago
2005
IEEE
Do we judge similarity between two objects to be the same using touch and vision? We investigated this using psychophysical experiments in which subjects rated the similarity betw...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
ICCSA
2003
Springer
14 years 1 months ago
2003
Springer
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CIKM
2000
Springer
14 years 26 days ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...