Sciweavers

627 search results - page 85 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 12 months ago
Fast approximate spectral clustering
Spectral 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-s...
Donghui Yan, Ling Huang, Michael I. Jordan
BMCBI
2011
14 years 2 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
DATAMINE
2006
89views more  DATAMINE 2006»
14 years 11 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
PR
2008
144views more  PR 2008»
14 years 11 months ago
Gesture spotting for low-resolution sports video annotation
Human gesture recognition plays an important role in automating the analysis of video material at a high level. Especially in sports videos, the determination of the player's...
Myung-Cheol Roh, William J. Christmas, Josef Kittl...
AUSAI
2004
Springer
15 years 3 months ago
Using Classification to Evaluate the Output of Confidence-Based Association Rule Mining
Abstract. Association rule mining is a data mining technique that reveals interesting relationships in a database. Existing approaches employ different parameters to search for int...
Stefan Mutter, Mark Hall, Eibe Frank