Fox and Brown's 'Random Data Sets' Are Not Random

Oikos ◽  
1995 ◽  
Vol 74 (3) ◽  
pp. 543 ◽  
Author(s):  
J. Bastow Wilson
Keyword(s):  
1968 ◽  
Vol 17 (4) ◽  
pp. 407 ◽  
Author(s):  
F. James Rohlf ◽  
David R. Fisher

2013 ◽  
Vol 791-793 ◽  
pp. 1289-1292
Author(s):  
Le Qiang Bai ◽  
Yan Yao Zhou ◽  
Shi Hong Zhang

Aiming at the problem of K-Means algorithm which is sensitive to select initial clustering center, this paper proposes a kind of initial point of K-Means algorithm. The algorithm processes the properties of the data objects, which determines the density of data object by counting the number of similar data objects and selects the center of categories according to the density of data object. The cluster numbers given and the UCI standard sets of data and the random data sets used, the clustering results demonstrate that the proposed algorithm has good stability, accuracy.


2013 ◽  
Vol 42 (5) ◽  
pp. e35-e35 ◽  
Author(s):  
Jun Ding ◽  
Haiyan Hu ◽  
Xiaoman Li

Abstract The identification of transcription factor binding motifs is important for the study of gene transcriptional regulation. The chromatin immunoprecipitation (ChIP), followed by massive parallel sequencing (ChIP-seq) experiments, provides an unprecedented opportunity to discover binding motifs. Computational methods have been developed to identify motifs from ChIP-seq data, while at the same time encountering several problems. For example, existing methods are often not scalable to the large number of sequences obtained from ChIP-seq peak regions. Some methods heavily rely on well-annotated motifs even though the number of known motifs is limited. To simplify the problem, de novo motif discovery methods often neglect underrepresented motifs in ChIP-seq peak regions. To address these issues, we developed a novel approach called SIOMICS to de novo discover motifs from ChIP-seq data. Tested on 13 ChIP-seq data sets, SIOMICS identified motifs of many known and new cofactors. Tested on 13 simulated random data sets, SIOMICS discovered no motif in any data set. Compared with two recently developed methods for motif discovery, SIOMICS shows advantages in terms of speed, the number of known cofactor motifs predicted in experimental data sets and the number of false motifs predicted in random data sets. The SIOMICS software is freely available at http://eecs.ucf.edu/∼xiaoman/SIOMICS/SIOMICS.html.


1968 ◽  
Vol 17 (4) ◽  
pp. 407-412 ◽  
Author(s):  
F. J. Rohlf ◽  
D. R. Fisher

Fractals ◽  
2018 ◽  
Vol 26 (01) ◽  
pp. 1850009 ◽  
Author(s):  
DAH-CHIN LUOR

Let [Formula: see text] be an integer greater than or equal to [Formula: see text] and let [Formula: see text] be numbers with [Formula: see text]. Denote that [Formula: see text] is the interval [Formula: see text] and [Formula: see text] is a set of points. Suppose that [Formula: see text] is a random perturbation of [Formula: see text] for [Formula: see text], and we set [Formula: see text]. Let [Formula: see text] and [Formula: see text] be linear fractal interpolation functions on [Formula: see text] corresponding to the set of points [Formula: see text] and [Formula: see text], respectively. The value [Formula: see text] is random for all [Formula: see text]. In this paper, we show that the expectation of [Formula: see text] is [Formula: see text]. We also establish estimations for the variance of [Formula: see text] and the expectation of [Formula: see text].


Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3102
Author(s):  
Weiyi Ding ◽  
Xiaoxian Tang

This paper is motivated by the difference between the classical principal component analysis (PCA) in a Euclidean space and the tropical PCA in a tropical projective torus as follows. In Euclidean space, the projection of the mean point of a given data set on the principle component is the mean point of the projection of the data set. However, in tropical projective torus, it is not guaranteed that the projection of a Fermat-Weber point of a given data set on a tropical polytope is a Fermat-Weber point of the projection of the data set. This is caused by the difference between the Euclidean metric and the tropical metric. In this paper, we focus on the projection on the tropical triangle (the three-point tropical convex hull), and we develop one algorithm and its improved version, such that for a given data set in the tropical projective torus, these algorithms output a tropical triangle, on which the projection of a Fermat-Weber point of the data set is a Fermat-Weber point of the projection of the data set. We implement these algorithms in R language and test how they work with random data sets. We also use R language for numerical computation. The experimental results show that these algorithms are stable and efficient, with a high success rate.


Sign in / Sign up

Export Citation Format

Share Document