Results 121 to 130 of about 1,861,121 (138)
The heterogeneous effects of perceptions of digital and intelligent technologies on multidimensional political identity among college students: a study of multiple parallel mediations from a stratified cluster perspective. [PDF]
Hou Q.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Clustering with or without the Approximation
Journal of Combinatorial Optimization, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schalekamp, F., Yu, M., Van Zuylen, A.
openaire +3 more sources
Approximate Spectral Clustering
2009While spectral clustering has recently shown great promise, computational cost makes it infeasible for use with large data sets. To address this computational challenge, this paper considers the problem of approximate spectral clustering, which enables both the feasibility (of approximately clustering in very large and unloadable data sets) and ...
Liang Wang 0001 +3 more
openaire +2 more sources
Approximation algorithms for projective clustering
Journal of Algorithms, 2003Summary: We consider the following two instances of the projective clustering problem: Given a set \(S\) of \(n\) points in \(\mathbb{R}^d\) and an integer \(k> 0\), cover \(S\) by \(k\) slabs (respectively \(d\)-cylinders) so that the maximum width of a slab (respectively the maximum diameter of a \(d\)-cylinder) is minimized.
Pankaj K. Agarwal +1 more
openaire +4 more sources
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2008Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by several applications in text mining, market-basket analysis, and bioinformatics, this problem has attracted severe attention in the past few years.
Aris Anagnostopoulos +2 more
openaire +1 more source
Clusterability and Centroid Approximation
2003Identifying clusters in a dataset is valuable. Most existing data clustering algorithms need the number of clusters as an input. The present paper introduces a graphical method that outputs the number of clusters. Once the number of clusters is calculated, other clustering algorithms may use it. This method is cubic in the number of input data.
Alina Romero, Mukkai S. Krishnamoorthy
openaire +1 more source
Fast approximate spectral clustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 2009Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-scale problems due to its computational complexity of O(n3) in general, with n the number of data points.
Donghui Yan +2 more
openaire +1 more source

