A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of rel
β¦ LIBER β¦
Bulk construction of dynamic clustered metric trees
β Scribed by Lior Aronovich; Israel Spiegler
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 786 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0219-1377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Structured Family of Clustering and Tr
β
David Bryant; Vincent Berry
π
Article
π
2001
π
Elsevier Science
π
English
β 190 KB
Molecular dynamics simulations of critic
β
A. Takeuchi; K. Yubuta; M. Ogata; A. Inoue
π
Article
π
2010
π
Springer
π
English
β 633 KB
A dynamic lattice searching method with
β
Xiaoli Yang; Wensheng Cai; Xueguang Shao
π
Article
π
2007
π
John Wiley and Sons
π
English
β 340 KB
π 1 views
## Abstract A variation of the previous dynamic lattice searching (DLS) method, named as DLS with constructed core (DLSc), was proposed for structural optimization of LennardβJones (LJ) clusters. In the new method, the starting random structure is generated with an icosahedron or a decahedron as a