Sciweavers

15494 search results - page 172 / 3099
» Computing dynamic clusters
Sort
View
ENDM
2006
77views more  ENDM 2006»
15 years 5 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
KDD
2002
ACM
122views Data Mining» more  KDD 2002»
16 years 5 months ago
Hierarchical model-based clustering of large datasets through fractionation and refractionation
The goal of clustering is to identify distinct groups in a dataset. Compared to non-parametric clustering methods like complete linkage, hierarchical model-based clustering has th...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 5 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
IRAL
2003
ACM
15 years 10 months ago
Keyword-based document clustering
1 Document clustering is an aggregation of related documents to a cluster based on the similarity evaluation task between documents and the representatives of clusters. Terms and t...
Seung-Shik Kang
AUSAI
2006
Springer
15 years 8 months ago
DynamicWEB: Profile Correlation Using COBWEB
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...
Joel Scanlan, Jacky Hartnett, Raymond Williams