96 search results - page 5 / 20 » Clustering event logs using iterative partitioning |
BPM
2008
Springer
13 years 9 months ago
2008
Springer
Process mining has proven to be a valuable tool for analyzing operational process executions based on event logs. Existing techniques perform well on structured processes, but stil...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
COMPGEOM
2009
ACM
14 years 16 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
COMPGEOM
1993
ACM
13 years 12 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
UAI
2004
13 years 9 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...