Filters








292,909 Hits in 3.8 sec

Clustering by compression [article]

Rudi Cilibrasi and Paul Vitanyi (CWI and University of Amsterdam)
2004 arXiv   pre-print
We present a new method for clustering based on compression.  ...  To extract a hierarchy of clusters from the distance matrix, we determine a dendrogram (binary tree) by a new quartet method and a fast heuristic to implement it.  ...  experiments, and data; Jorma Rissanen and Boris Ryabko for discussions, Tzu-Kuo Huang for pointing out some typos and simplifications, and Teemu Roos and Henri Tirry for implementing a visualization of the clustering  ... 
arXiv:cs/0312044v2 fatcat:7kxq7xadyzd2xnup36aqxrnboq

Clustering by Compression

R. Cilibrasi, P.M.B. Vitanyi
2005 IEEE Transactions on Information Theory  
We present a new method for clustering based on compression.  ...  To extract a hierarchy of clusters from the distance matrix, we determine a dendrogram (binary tree) by a new quartet method and a fast heuristic to implement it.  ...  and Boris Ryabko for discussions, John Langford for suggestions, Tzu-Kuo Huang for pointing out some typos and simplifications, and Teemu Roos and Henri Tirry for implementing a visualization of the clustering  ... 
doi:10.1109/tit.2005.844059 fatcat:imrem6kkszbfjhh6aom6udfhga

Clustering Heterogeneous Web Data using Clustering by Compression. Cluster Validity

Alexandra Cernian, Dorin Carstoiu, Adriana Olteanu
2008 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
In this paper, we intend to test the results of a new clustering technique -clustering by compression -when applied to heterogeneous sets of data.  ...  The clustering by compression procedure is based on a parameter-free, universal, similarity distance, the normalized compression distance or NCD, computed from the lengths of compressed data files (singly  ...  The clustering by compression procedure is based on a parameter-free, universal, similarity distance, the normalized compression distance or NCD, computed from the lengths of compressed data files (singly  ... 
doi:10.1109/synasc.2008.64 dblp:conf/synasc/CernianCO08 fatcat:fvcpuwtki5hjplt65bjczoflqm

Training Set Compression by Incremental Clustering

Dalong Li, Steven Simske
2011 Journal of Pattern Recognition Research  
Conclusion In this paper, the Leader clustering algorithm is proposed to compress the training set. This compression is achieved by a subsampling process.  ...  The purpose of compression is to remove redundancy in a training set. Sequential leader clustering [12] is one of classical clustering algorithms.  ... 
doi:10.13176/11.254 fatcat:es3noda4rrfwnlklj4jczo73aa

Clustering fetal heart rate tracings by compression [article]

C. Costa Santos, P. Vitanyi
2006 arXiv   pre-print
We clustered FHR tracings by compression in order to identify abnormal ones.  ...  Moreover, FHR tracings with future poor neonatal outcomes were included in the cluster with other suspicious patterns.  ... 
arXiv:q-bio/0612013v1 fatcat:vnvnesrufzaurkl2keujuzqcyq

Compressing Deep Networks by Neuron Agglomerative Clustering

Li-Na Wang, Wenxue Liu, Xiang Liu, Guoqiang Zhong, Partha Pratim Roy, Junyu Dong, Kaizhu Huang
2020 Sensors  
In this paper, to tackle this problem, we introduce a method for compressing the structure and parameters of DNNs based on neuron agglomerative clustering (NAC).  ...  Specifically, on the benchmark CIFAR-10 and CIFAR-100 datasets, using NAC to compress the parameters of the original VGGNet by 92.96% and 81.10%, respectively, the compact network obtained still outperforms  ...  At the same time, by comparing the results obtained by applying the agglomerative clustering and the k-means clustering, it is obviously shown that the results obtained by applying the agglomerative clustering  ... 
doi:10.3390/s20216033 pmid:33114078 pmcid:PMC7660330 fatcat:hetsfskkifdlbhdgkbdh66ked4

Multispectral image compression by cluster-adaptive subspace representation

Hui-Liang Shen, Ke Li, John H. Xin
2010 2010 IEEE International Conference on Image Processing  
The dimensionality of each adaptive subspace is determined by specified reconstruction error level, followed by further cluster splitting if necessary.  ...  This paper proposes a framework for spectral compression of multispectral image by using clusteradaptive subspaces representation.  ...  similar reflectances, and then compress these reflectances by the cluster-adaptive subspaces.  ... 
doi:10.1109/icip.2010.5652058 dblp:conf/icip/ShenLX10 fatcat:yht5hlx25veqpc5rbocd7wp5fm

Compressive Effects on the Galactic Globular Clusters by Gravitational Disk-Shocking

Masaaki Shimada
1999 Symposium - International astronomical union  
Observed figures of the Galactic globular clusters are somewhat elliptic in many cases.  ...  By a series of numerical experiments, we study whether or not tidal force from the Galactic disk can produce the observed ellipticities in such an inner region (Shimada 1996)  ...  The clusters mean force field is calculated by the SCF method (Hernquist & Ostriker 1992) , and the tidal force field is given from a plane parallel disk model.  ... 
doi:10.1017/s0074180900112239 fatcat:tnq26ulr6vaz7j3q2zpagqljqi

Reviving fossil radio plasma in clusters of galaxies by adiabatic compression in environmental shock waves

T. A. Enßlin, Gopal-Krishna
2001 Astronomy and Astrophysics  
clusters, or by the accretion onto galaxy clusters.  ...  It is demonstrated that fossil radio plasma with an age of even up to 2 Gyr can be revived by compression in a shock wave of large-scale structure formation, caused during the merging events of galaxy  ...  This pressure is produced by compression.  ... 
doi:10.1051/0004-6361:20000198 fatcat:3zxpk2fxbvahjo5tlfrxobza24

Particle reacceleration by compressible turbulence in galaxy clusters: effects of a reduced mean free path

G. Brunetti, A. Lazarian
2011 Monthly notices of the Royal Astronomical Society  
In this paper we explore a different picture of acceleration by compressible turbulence in galaxy clusters, where the interaction between turbulence and the IGM is mediated by plasma instabilities and  ...  Assuming that relativistic protons contribute to several percent (or less) of the cluster energy, consistent with the FERMI observations of nearby clusters, we find that compressible turbulence at the  ...  We acknowledge grants from INAF (PRIN-INAF2007 and 2008), ASI-INAF (I/088/06/0), NSF (AST 0808118) and NASA (NNX09AH78G) and support by the NSF Center for Magnetic Self-Organization.  ... 
doi:10.1111/j.1365-2966.2010.17937.x fatcat:dclsopglq5f6rfdfvh6e3czrky

Formation, compression and surface melting of colloidal clusters by active particles

Felix Kümmel, Parmida Shabestari, Celia Lozano, Giovanni Volpe, Clemens Bechinger
2015 Soft Matter  
Induced cluster formation of passive particles by the motion of the actives and appendant distribution functions.  ...  This work is financially supported by the Deutsche Forschungsgemeinschaft within the Schwerpunktsprogramm Microswimmers SPP 1726.  ...  compression of clusters of passive particles (marked in red in Fig. 1) .  ... 
doi:10.1039/c5sm00827a pmid:26136053 fatcat:sd7pzlz2enb5di5w6bg2npn7zy

A New Approach to Free-form Cluster Lens Modeling Inspired by the JPEG Image Compression Method

Daniel Lam
2019 Publications of the Astronomical Society of the Pacific  
I propose a new approach to free-form cluster lens modeling that is inspired by the JPEG image compression method.  ...  This approach is motivated specifically by the need for accurate modeling of high-magnification regions in galaxy clusters.  ...  SUMMARY In this paper, I propose a new approach to free-form cluster lens modeling inspired by the parametrization used in JPEG image compression.  ... 
doi:10.1088/1538-3873/ab35c0 fatcat:kki5ojrh2fdrnavxtzf2qapz7q

Lossless Compression of Data Tables in Mobile Devices by Using Co-clustering

Bo Han, Bolang Li
2016 International Journal of Computers Communications & Control  
In this paper, we propose a novel lossless compression approach by combining co-clustering and information coding theory.  ...  The results also show that the compression time cost of the co-clustering approach is linearly proportional to a data table size.  ...  And the 5 th and 6 th columns (column header "size by 7Zco" and "CR by 7Zco") give the compressed file sizes and compression rates by using co-clustering.  ... 
doi:10.15837/ijccc.2016.6.2554 fatcat:7aesnebpefggpnlrznr6cdjzuq

Tree based Energy Balanced Routing Protocol by using Clustering and Compressive Sensing Technique

Smriti Salaria, Ridhi Kapoor
2015 International Journal of Computer Applications  
The future technique has the capability to overcome the restrictions of the GSTEB routing protocol by using the compressive sensing and level based clustering.  ...  But it has ignored the use of the three things like the effect of the mobile sink, Clustering and the effect of the compressive sensing.  ...  In this research work, clustering and compressed data is considered. data will be compressed by using compressive sensing technique. sensing based.  ... 
doi:10.5120/ijca2015906895 fatcat:u63zvlifr5cotpw63bsuow6bmm

Acceleration of primary and secondary particles in galaxy clusters by compressible MHD turbulence: from radio haloes to gamma-rays

G. Brunetti, A. Lazarian
2010 Monthly notices of the Royal Astronomical Society  
compressible MHD turbulence by considering self-consistently the reacceleration of both primary and secondary particles.  ...  limits derived by present observations of clusters without radio halos.  ...  We acknowledge grants from INAF (PRIN-INAF2007 and 2008), ASI-INAF (I/088/06/0), NSF (AST 0808118) and NASA (NNX09AH78G) and support by the NSF Center for Magnetic Self-Organization.  ... 
doi:10.1111/j.1365-2966.2010.17457.x fatcat:ze7n5h7c3famjfzxei656oovd4
« Previous Showing results 1 — 15 out of 292,909 results