538 search results - page 96 / 108 » Dimension induced clustering |
SBACPAD
2003
IEEE
14 years 3 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
ICCSA
2003
Springer
14 years 2 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 2 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 2 months 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...
WIDM
1999
ACM
14 years 2 months ago
1999
ACM
Analyzing Web Logs for usage and access trends can not only provide important information to web site developers and administrators, but also help in creating adaptive web sites. ...