ON AN ADJACENCY CLUSTER MERIT

Date

2010-02-04

Author

Volkovich, Zeev (Vladimir)
Weber, Gerhard Wilhelm
Avros, Renata

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

97
views

0
downloads

This work is addressed to the problem of cluster validation to determine the right number of clusters. We consider a cluster stability property based on the k nearest neighbor type coincidences model. Cluster quality is measured by the deviations from this model such that good constructed clusters are typified by small departures values. The true number of clusters corresponds to the empirical deviation distribution having shortest right tail. The experiments carried out on synthetic and real databases demonstrate the effectiveness of the approach.

Subject Keywords

Clustering, Nearest Neighbors, Data Mining, Two Sample Test, Cluster Stability

URI

https://hdl.handle.net/11511/53976

DOI

https://doi.org/10.1063/1.3459773

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

On a Minimal Spanning, Tree Approach in the Cluster Validation Problem Barzily, Zeev; Volkovich, Zeev; Öztürk, Başak; Weber, Gerhard Wilhelm (2009-01-01) In this paper, a method for the study of cluster stability is purposed. We draw pairs of samples from the data, according to two sampling distributions. The first distribution corresponds to the high density zones of data-elements distribution. Thus it is associated with the clusters cores. The second one, associated with file cluster margins, is related to the low density zones. The samples are clustered and the two obtained partitions are compared. The partitions are considered to be consistent if the obt...
ON THE k-TH ORDER LFSR SEQUENCE WITH PUBLIC KEY CRYPTOSYSTEMS KIRLAR, Barış Bülent; Cil, Melek (Walter de Gruyter GmbH, 2017-06-01) In this paper, we propose a novel encryption scheme based on the concepts of the commutative law of the k-th order linear recurrences over the finite field F-q for k > 2. The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving some Linear Feedback Shift Register (LFSR) problems. It has also the property of semantic security. For k = 2, we propose ...
A Bayesian Approach to Learning Scoring Systems Ertekin Bolelli, Şeyda (2015-12-01) We present a Bayesian method for building scoring systems, which are linear models with coefficients that have very few significant digits. Usually the construction of scoring systems involve manual efforthumans invent the full scoring system without using data, or they choose how logistic regression coefficients should be scaled and rounded to produce a scoring system. These kinds of heuristics lead to suboptimal solutions. Our approach is different in that humans need only specify the prior over what the ...
TRAINER: A General-Purpose Trainable Short Biosequence Classifer OĞUL, HASAN; Kalkan, Alper T.; Umu, Sinan U.; Akkaya, Mahinur (2013-10-01) Classifying sequences is one of the central problems in computational biosciences. Several tools have been released to map an unknown molecular entity to one of the known classes using solely its sequence data. However, all of the existing tools are problem-specific and restricted to an alphabet constrained by relevant biological structure. Here, we introduce TRAINER, a new online tool designed to serve as a generic sequence classification platform to enable users provide their own training data with any al...
ON THE LATTICE STRUCTURE OF A NONLINEAR GENERATOR WITH MODULUS 2-ALPHA EICHENAUERHERRMANN, J; GROTHE, H; NIEDERREITER, H; TOPUZOGLU, A (1990-07-24) Nonlinear congruential pseudorandom number generators based on inversions have been introduced and analysed recently. These generators do not show the simple lattice structure of the widely used linear congruential generators which are too regular for certain simulation purposes. In the present paper a nonlinear congruential generator based on inversions with respect to a power of two modulus is considered. It is shown that the set of points formed by consecutive pseudorandom numbers has a more complicated ...

Citation Formats

Z. (. Volkovich, G. W. Weber, and R. Avros, “ON AN ADJACENCY CLUSTER MERIT,” 2010, vol. 1239, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53976.