Sciweavers

4085 search results - page 108 / 817
» Benchmarking Data Mining Algorithms
Sort
View
TKDE
1998
111views more  TKDE 1998»
13 years 9 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
ICDM
2007
IEEE
248views Data Mining» more  ICDM 2007»
14 years 2 months ago
Adapting SVM Classifiers to Data with Shifted Distributions
Many data mining applications can benefit from adapting existing classifiers to new data with shifted distributions. In this paper, we present Adaptive Support Vector Machine (Ada...
Jun Yang 0003, Rong Yan, Alexander G. Hauptmann
WWW
2006
ACM
14 years 11 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
INTERNET
2006
157views more  INTERNET 2006»
13 years 10 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
JCIT
2010
174views more  JCIT 2010»
13 years 5 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram