Sciweavers

1599 search results - page 41 / 320
» Theoretical Frameworks for Data Mining
Sort
View
ICDM
2010
IEEE
160views Data Mining» more  ICDM 2010»
13 years 5 months ago
A Privacy Preserving Framework for Gaussian Mixture Models
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
Madhusudana Shashanka
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 5 months ago
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-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
CIE
2005
Springer
13 years 9 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
DEXA
2001
Springer
112views Database» more  DEXA 2001»
14 years 7 days ago
An Information-Driven Framework for Image Mining
Image mining systems that can automatically extract semantically meaningful information (knowledge) from image data are increasingly in demand. The fundamental challenge in image m...
Ji Zhang, Wynne Hsu, Mong-Li Lee
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 20 days ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu