Sciweavers

CINQ
2004
Springer
131views Database» more  CINQ 2004»
13 years 10 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CIKM
2004
Springer
13 years 10 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar
CASDMKM
2004
Springer
147views Data Mining» more  CASDMKM 2004»
13 years 10 months ago
Data Set Balancing
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
David L. Olson
AMAI
2004
Springer
13 years 10 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
ICML
2004
IEEE
13 years 10 months ago
Redundant feature elimination for multi-class problems
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
Annalisa Appice, Michelangelo Ceci, Simon Rawles, ...
DMKD
2004
ACM
127views Data Mining» more  DMKD 2004»
13 years 10 months ago
Discovering spatial patterns accurately with effective noise removal
Cluster analysis is a common approach to pattern discovery in spatial databases. While many clustering techniques have been developed, it is still challenging to discover implicit...
Yu Qian, Kang Zhang
SSD
2005
Springer
122views Database» more  SSD 2005»
13 years 10 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
SCIA
2005
Springer
113views Image Analysis» more  SCIA 2005»
13 years 10 months ago
Segmentation of Medical Images Using Three-Dimensional Active Shape Models
In this paper a fully automated segmentation system for the femur in the knee in Magnetic Resonance Images and the brain in Single Photon Emission Computed Tomography images is pr...
Klas Josephson, Anders Ericsson, Johan Karlsson
MLDM
2005
Springer
13 years 10 months ago
Using Clustering to Learn Distance Functions for Supervised Similarity Assessment
Assessing the similarity between objects is a prerequisite for many data mining techniques. This paper introduces a novel approach to learn distance functions that maximizes the c...
Christoph F. Eick, Alain Rouhana, Abraham Bagherje...
IWANN
2005
Springer
13 years 10 months ago
Heuristic Search over a Ranking for Feature Selection
In this work, we suggest a new feature selection technique that lets us use the wrapper approach for finding a well suited feature set for distinguishing experiment classes in hig...
Roberto Ruiz, José Cristóbal Riquelm...