Sciweavers

PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
13 years 10 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
PKDD
2005
Springer
136views Data Mining» more  PKDD 2005»
13 years 10 months ago
Weka4WS: A WSRF-Enabled Weka Toolkit for Distributed Data Mining on Grids
This paper presents Weka4WS, a framework that extends the Weka toolkit for supporting distributed data mining on Grid environments. Weka4WS adopts the emerging Web Services Resourc...
Domenico Talia, Paolo Trunfio, Oreste Verta
PKDD
2005
Springer
142views Data Mining» more  PKDD 2005»
13 years 10 months ago
Speeding Up Logistic Model Tree Induction
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
Marc Sumner, Eibe Frank, Mark A. Hall
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
13 years 10 months ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...
PKDD
2005
Springer
85views Data Mining» more  PKDD 2005»
13 years 10 months ago
Improving Generalization by Data Categorization
In most of the learning algorithms, examples in the training set are treated equally. Some examples, however, carry more reliable or critical information about the target than the ...
Ling Li, Amrit Pratap, Hsuan-Tien Lin, Yaser S. Ab...
PKDD
2005
Springer
94views Data Mining» more  PKDD 2005»
13 years 10 months ago
Visual Terrain Analysis of High-Dimensional Datasets
Abstract. Most real-world datasets are, to a certain degree, skewed. When considered that they are also large, they become the pinnacle challenge in data analysis. More importantly...
Wenyuan Li, Kok-Leong Ong, Wee Keong Ng
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
13 years 10 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
PKDD
2005
Springer
155views Data Mining» more  PKDD 2005»
13 years 10 months ago
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
PKDD
2005
Springer
109views Data Mining» more  PKDD 2005»
13 years 10 months ago
An Imbalanced Data Rule Learner
Imbalanced data learning has recently begun to receive much attention from research and industrial communities as traditional machine learners no longer give satisfactory results. ...
Canh Hao Nguyen, Tu Bao Ho
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
13 years 10 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...