Sciweavers

DAWAK
2005
Springer
14 years 2 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
CIKM
2005
Springer
14 years 2 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
ATAL
2005
Springer
14 years 2 months ago
Implicit: an agent-based recommendation system for web search
The number of web pages available on Internet increases day after day, and consequently finding relevant information becomes more and more a hard task. However, when we consider ...
Aliaksandr Birukou, Enrico Blanzieri, Paolo Giorgi...
AISADM
2005
Springer
14 years 2 months ago
Execution Engine of Meta-learning System for KDD in Multi-agent Environment
Meta-learning system for KDD is an open and evolving platform for efficient testing and intelligent recommendation of data mining process. Metalearning is adopted to automate the s...
Ping Luo, Qing He, Rui Huang, Fen Lin, Zhongzhi Sh...
ADMA
2005
Springer
149views Data Mining» more  ADMA 2005»
14 years 2 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 2 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 2 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 2 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 2 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 2 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