The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Trajectory clustering with mixtures of regression models
Open accessAbstract
In this paper we address the problem of clustering trajectories, namely sets of short sequences of data measured as a function of a dependent variable such as time.Examples include storm path trajectories, longitudinal data such as drug therapy response, functional expression data in computational biology, and movements of objects or individuals in video sequences.Our clustering algorithm is based on a principled method for probabilistic modelhng of a set of trajectories as individual sequences of points generated from a finite mixture model consisting of regression model components.Unsupervised learning is carried out using maximum likelihood principles.Specifically, the EM algorithm is used to cope with the hidden data problem (i.e., the cluster memberships).We also develop generalizations of the method to handle non-parametric (kernel) regression components as well as multi-dimensional outputs.Simulation results comparing our method with other clustering methods such as K-means and Gaussian mixtures are presented as well as experimental results on real data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2005) · Technometrics · doi:10.1198/tech.2005.s303 · Cited by 17,923
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Local Polynomial Modelling and its Applications
Fan, J., & Gijbels, I. (1994) · Springer eBooks · doi:10.1007/978-1-4899-3150-4 · Cited by 2,849
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
Wand, M. P., & Jones, M. C. (1995) · Springer eBooks · doi:10.1007/978-1-4899-4493-1 · Cited by 2,663
How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
Fraley, C. (1998) · The Computer Journal · doi:10.1093/comjnl/41.8.578 · Cited by 2,549
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
Muraki, E., Ramsay, J. O., & Silverman, B. W. (1999) · Journal of Educational and Behavioral Statistics · doi:10.2307/1165264 · Cited by 1,013
The University of California: A Pictorial History
Pickerell, A. G., & Dornin, M. (2023) · University of California Press eBooks · doi:10.2307/jj.8501461 · Cited by 515
Longitudinal Data with Serial Correlation: A State-space Approach
Jones, R. H. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203748640 · Cited by 313
Model selection for probabilistic clustering using cross-validated likelihood
Smyth, P. (2000) · Statistics and Computing · doi:10.1023/a:1008940618127 · Cited by 285
Self-citationLongitudinal Data with Serial Correlation
Jones, R. H. (1993) · doi:10.1007/978-1-4899-4489-4 · Cited by 235
Multiple Regimes in Northern Hemisphere Height Fields via MixtureModel Clustering*
Smyth, P., Ide, K., & Ghil, M. (1999) · Journal of the Atmospheric Sciences · doi:10.1175/1520-0469(1999)056<3704:mrinhh>2.0.co;2 · Cited by 194
Self-citation
Cited by
Discovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468
Trajectory clustering: a partition-and-group framework
Lee, J.-G., Han, J., & Whang, K.-Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247546 · Cited by 1,363
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Spatio-Temporal Data Mining: A Survey of Problems and Methods
Atluri, G., Karpatne, A., & Kumar, V. (2019) · ACM Computing Surveys · doi:10.1145/3161602 · Cited by 461
Metadata
- Authors
- Gaffney, S., & Smyth, P.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 63-72
- OpenAlex
- W2047216628
- Cited by
- 443
- References
- 14
- FWCI
- 2.55
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.