Sciweavers

728 search results - page 48 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
FLAIRS
2006
13 years 9 months ago
Mining the Web to Determine Similarity Between Words, Objects, and Communities
The World Wide Web provides a wealth of data that can be harnessed to help improve information retrieval and increase understanding of the relationships between different entities...
Mehran Sahami
DAWAK
2001
Springer
14 years 12 days ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
CIS
2005
Springer
14 years 1 months ago
An Improved EMASK Algorithm for Privacy-Preserving Frequent Pattern Mining
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
Congfu Xu, Jinlong Wang, Hongwei Dan, Yunhe Pan
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ADMA
2009
Springer
145views Data Mining» more  ADMA 2009»
14 years 2 months ago
A Framework for Multi-Objective Clustering and Its Application to Co-Location Mining
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Ricar...