Sciweavers

7053 search results - page 1255 / 1411
» Data Mining
Sort
View
PAISI
2010
Springer
15 years 4 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
SAC
2010
ACM
16 years 1 months ago
Feature selection for ordinal regression
Ordinal regression (also known as ordinal classification) is a supervised learning task that consists of automatically determining the implied rating of a data item on a fixed, ...
Stefano Baccianella, Andrea Esuli, Fabrizio Sebast...
COMPUTE
2011
ACM
14 years 10 months ago
Similarity analysis of legal judgments
In this paper, we have made an effort to propose approaches to find similar legal judgements by extending the popular techniques used in information retrieval and search engines...
Sushanta Kumar, P. Krishna Reddy, V. Balakista Red...
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
16 years 7 months ago
Scrutinizing Frequent Pattern Discovery Performance
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
Mohammad El-Hajj, Osmar R. Zaïane, Stella Luk...
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 7 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
« Prev « First page 1255 / 1411 Last » Next »