Sciweavers

4039 search results - page 508 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ADC
2005
Springer
183views Database» more  ADC 2005»
16 years 7 days ago
Discovering User Access Pattern Based on Probabilistic Latent Factor Model
There has been an increased demand for characterizing user access patterns using web mining techniques since the informative knowledge extracted from web server log files can not ...
Guandong Xu, Yanchun Zhang, Jiangang Ma, Xiaofang ...
SDM
2003
SIAM
183views Data Mining» more  SDM 2003»
15 years 8 months ago
ApproxMAP: Approximate Mining of Consensus Sequential Patterns
Conventional sequential pattern mining methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivi...
Hye-Chung Kum, Jian Pei, Wei Wang 0010, Dean Dunca...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
16 years 23 days ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 10 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
SAC
2005
ACM
16 years 8 days ago
Using object-level run-time metrics to study coupling between objects
In this paper we present an investigation into the run-time behaviour of objects in Java programs, using specially adapted coupling metrics. We identify objects from the same clas...
Áine Mitchell, James F. Power