Sciweavers

652 search results - page 60 / 131
» Accelerated EM-based clustering of large data sets
Sort
View
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
13 years 9 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 8 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
IDEAL
2004
Springer
14 years 1 months ago
The Application of K-Medoids and PAM to the Clustering of Rules
Abstract. Earlier research has resulted in the production of an ‘allrules’ algorithm for data-mining that produces all conjunctive rules of above given confidence and coverage...
Alan P. Reynolds, Graeme Richards, Victor J. Raywa...
MM
2009
ACM
125views Multimedia» more  MM 2009»
14 years 2 months ago
Unfolding speaker clustering potential: a biomimetic approach
Speaker clustering is the task of grouping a set of speech utterances into speaker-specific classes. The basic techniques for solving this task are similar to those used for spea...
Thilo Stadelmann, Bernd Freisleben
ARC
2007
Springer
123views Hardware» more  ARC 2007»
14 years 1 days ago
Multiple Sequence Alignment Using Reconfigurable Computing
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
Carlos R. Erig Lima, Heitor S. Lopes, Maiko R. Mor...