Sciweavers

Share
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
9 years 2 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
9 years 2 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
PKDD
2005
Springer
125views Data Mining» more  PKDD 2005»
9 years 2 months ago
A Propositional Approach to Textual Case Indexing
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
Nirmalie Wiratunga, Robert Lothian, Sutanu Chakrab...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
9 years 2 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
PKDD
2005
Springer
159views Data Mining» more  PKDD 2005»
9 years 2 months ago
Fast Burst Correlation of Financial Data
We examine the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. Our methodology is comprised of two steps: a burst dete...
Michail Vlachos, Kun-Lung Wu, Shyh-Kwei Chen, Phil...
PKDD
2005
Springer
167views Data Mining» more  PKDD 2005»
9 years 2 months ago
Hybrid Cost-Sensitive Decision Tree
Cost-sensitive decision tree and cost-sensitive naïve Bayes are both new cost-sensitive learning models proposed recently to minimize the total cost of test and misclassifications...
Shengli Sheng, Charles X. Ling
PKDD
2005
Springer
123views Data Mining» more  PKDD 2005»
9 years 2 months ago
A Multi-metric Index for Euclidean and Periodic Matching
In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
Michail Vlachos, Zografoula Vagena, Vittorio Caste...
PKDD
2005
Springer
161views Data Mining» more  PKDD 2005»
9 years 2 months ago
Active Sampling for Knowledge Discovery from Biomedical Data
Abstract. We describe work aimed at cost-constrained knowledge discovery in the biomedical domain. To improve the diagnostic/prognostic models of cancer, new biomarkers are studied...
Sriharsha Veeramachaneni, Francesca Demichelis, Em...
PKDD
2005
Springer
131views Data Mining» more  PKDD 2005»
9 years 2 months ago
ISOLLE: Locally Linear Embedding with Geodesic Distance
Locally Linear Embedding (LLE) has recently been proposed as a method for dimensional reduction of high-dimensional nonlinear data sets. In LLE each data point is reconstructed fro...
Claudio Varini, Andreas Degenhard, Tim W. Nattkemp...
PKDD
2005
Springer
130views Data Mining» more  PKDD 2005»
9 years 2 months ago
Unsupervised Discretization Using Tree-Based Density Estimation
This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the...
Gabi Schmidberger, Eibe Frank
books