Sciweavers

ADMA
2005
Springer
202views Data Mining» more  ADMA 2005»
14 years 1 months ago
A Latent Usage Approach for Clustering Web Transaction and Building User Profile
Web transaction data between web visitors and web functionalities usually convey users’ task-oriented behavior patterns. Clustering web transactions, thus, may capture such infor...
Yanchun Zhang, Guandong Xu, Xiaofang Zhou
ADMA
2005
Springer
117views Data Mining» more  ADMA 2005»
14 years 1 months ago
Context-Sensitive Regression Analysis for Distributed Data
A precondition of existing ensemble-based distributed data mining techniques is the assumption that contributing data are identically and independently distributed. However, this a...
Yan Xing, Michael G. Madden, Jim Duggan, Gerard Ly...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 1 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ADMA
2005
Springer
134views Data Mining» more  ADMA 2005»
14 years 1 months ago
An LZ78 Based String Kernel
We develop the notion of normalized information distance (NID) [7] into a kernel distance suitable for use with a Support Vector Machine classifier, and demonstrate its use for an...
Ming Li, Ronan Sleep
ADMA
2005
Springer
149views Data Mining» more  ADMA 2005»
14 years 5 months ago
A New Support Vector Machine for Data Mining
Abstract. This paper proposes a new support vector machine (SVM) with a robust loss function for data mining. Its dual optimal formation is also constructed. A gradient based algor...
Haoran Zhang, Xiaodong Wang, Changjiang Zhang, Xiu...
ADMA
2005
Springer
119views Data Mining» more  ADMA 2005»
14 years 5 months ago
Heuristic Scheduling of Concurrent Data Mining Queries
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed toget...
Marek Wojciechowski, Maciej Zakrzewicz
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
14 years 5 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
ADMA
2005
Springer
144views Data Mining» more  ADMA 2005»
14 years 5 months ago
One Dependence Augmented Naive Bayes
In real-world data mining applications, an accurate ranking is same important to a accurate classification. Naive Bayes (simply NB) has been widely used in data mining as a simple...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su
ADMA
2005
Springer
143views Data Mining» more  ADMA 2005»
14 years 5 months ago
A Comprehensive Benchmark of the Artificial Immune Recognition System (AIRS)
: Artificial Immune Systems are a new class of algorithms inspired by how the immune system recognizes, attacks and remembers intruders. This is a fascinating idea, but to be accep...
Lingjun Meng, Peter van der Putten, Haiyang Wang
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
14 years 5 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora