𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection

✍ Scribed by M.R. Brito; E.L. Chávez; A.J. Quiroz; J.E. Yukich

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
610 KB
Volume
35
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

✦ Synopsis

For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is proposed and its performance is evaluated in simulated data.

📜 SIMILAR VOLUMES

A clustering procedure based on the comp
A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree
✍ José Marı́a González-Barrios; Adolfo J. Quiroz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 250 KB

We present a procedure for the identiÿcation of clusters in multivariate data sets, based on the comparison between the k nearest neighbors graph, G k , and the minimal spanning tree, MST. Our key statistic is the random quantity k := the smallest k such that G k contains the MST. Under regularity a

Efficient calculation of configurational
Efficient calculation of configurational entropy from molecular simulations by combining the mutual-information expansion and nearest-neighbor methods
✍ Vladimir Hnizdo; Jun Tan; Benjamin J. Killian; Michael K. Gilson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract Changes in the configurational entropies of molecules make important contributions to the free energies of reaction for processes such as protein‐folding, noncovalent association, and conformational change. However, obtaining entropy from molecular simulations represents a long‐standing

The existence of a 2-factor in K1, n-fre
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Relationship Between the Nearest-Neighbo
Relationship Between the Nearest-Neighbor Exchange Coupling Constants and the Number of Exchange Interactions in the Cyano-Bridged MnMo6(CN)18 Cluster: Density Functional Theory Calculations
✍ Yi-Quan Zhang; Cheng-Lin Luo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 1 views

## Abstract A theoretical density functional study of the relationship between the nearest‐neighbor MnMo constants and the number of exchange interactions in the cyano‐bridged K[(Me~3~tacn)~6~MnMo~6~(CN)~18~](ClO~4~)~3~ cluster is presented. Two approaches (the first approach consisted of evaluatin