Sciweavers

2383 search results - page 8 / 477
» Finding Representative Set from Massive Data
Sort
View
JMLR
2010
175views more  JMLR 2010»
13 years 1 months ago
Hierarchical Convex NMF for Clustering Massive Data
We present an extension of convex-hull non-negative matrix factorization (CH-NMF) which was recently proposed as a large scale variant of convex non-negative matrix factorization ...
Kristian Kersting, Mirwaes Wahabzada, Christian Th...
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 1 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
ICML
2003
IEEE
14 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
HICSS
2009
IEEE
123views Biometrics» more  HICSS 2009»
14 years 1 months ago
Users' Influence on the Success of Online Communities
This paper examines how different facets of favorable user behavior drive the success of an online community by using a unique data set with surveys from 1,389 participants from t...
Jakob Assmann, Philipp Sandner, Sophie Ahrens
AUSAI
2006
Springer
13 years 10 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert