UCI-ml
UC Irvine Machine Learning Repository. We currently maintain 251 data sets as a service to the machine learning community. You may view all data sets through our searchable interface. Our old web site is still available, for those who prefer the old format. For a general overview of the Repository, please visit our About page. For information about citing data sets in publications, please read our citation policy. If you wish to donate a data set, please consult our donation policy. For any other questions, feel free to contact the Repository librarians. We have also set up a mirror site for the Repository. The UCI Machine Learning Repository is a collection of databases, domain theories, and data generators that are used by the machine learning community for the empirical analysis of machine learning algorithms. The archive was created as an ftp archive in 1987 by David Aha and fellow graduate students at UC Irvine. Since that time, it has been widely used by students, educators, and researchers all over the world as a primary source of machine learning data sets. As an indication of the impact of the archive, it has been cited over 1000 times, making it one of the top 100 most cited ”papers” in all of computer science. The current version of the web site was designed in 2007 by Arthur Asuncion and David Newman, and this project is in collaboration with Rexa.info at the University of Massachusetts Amherst. Funding support from the National Science Foundation is gratefully acknowledged. Many people deserve thanks for making the repository a success. Foremost among them are the donors and creators of the databases and data generators. Special thanks should also go to the past librarians of the repository: David Aha, Patrick Murphy, Christopher Merz, Eamonn Keogh, Cathy Blake, Seth Hettich, and David Newman.
Keywords for this software
References in zbMATH (referenced in 3041 articles )
Showing results 1 to 20 of 3041.
Sorted by year (- Adona, V. A.; Gonçalves, M. L. N.; Melo, J. G.: An inexact proximal generalized alternating direction method of multipliers (2020)
- Afridi, Mohammad Khan; Azam, Nouman; Yao, JingTao: Variance based three-way clustering approaches for handling overlapping clustering (2020)
- Akhanli, Serhat Emre; Hennig, Christian: Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes (2020)
- Alexandrov, Alexander; Benidis, Konstantinos; Bohlke-Schneider, Michael; Flunkert, Valentin; Gasthaus, Jan; Januschowski, Tim; Maddix, Danielle C.; Rangapuram, Syama; Salinas, David; Schulz, Jasper; Stella, Lorenzo; Türkmen, Ali Caner; Wang, Yuyang: GluonTS: probabilistic and neural time series modeling in Python (2020)
- Almodóvar-Rivera, Israel A.; Maitra, Ranjan: Kernel-estimated nonparametric overlap-based syncytial clustering (2020)
- Andrew G. Allmon, J.S. Marron, Michael G. Hudgens: diproperm: An R Package for the DiProPerm Test (2020) arXiv
- Azam, Muhammad; Alghabashi, Basim; Bouguila, Nizar: Multivariate bounded asymmetric Gaussian mixture model (2020)
- Baldomero-Naranjo, Marta; Martínez-Merino, Luisa I.; Rodríguez-Chía, Antonio M.: Tightening big Ms in integer programming formulations for support vector machines with ramp loss (2020)
- Bartels, Simon; Hennig, Philipp: Conjugate gradients for kernel machines (2020)
- Bellavia, Stefania; Krejić, Nataša; Morini, Benedetta: Inexact restoration with subsampled trust-region methods for finite-sum minimization (2020)
- Bellavia, Stefania; Krklec Jerinkić, Nataša; Malaspina, Greta: Subsampled nonmonotone spectral gradient methods (2020)
- Bertsimas, Dimitris; Cory-Wright, Ryan: On polyhedral and second-order cone decompositions of semidefinite optimization problems (2020)
- Bertsimas, Dimitris; Li, Michael Lingzhi: Scalable holistic linear regression (2020)
- Bing, Xin; Bunea, Florentina; Wegkamp, Marten: A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (2020)
- Blanco, Víctor; Japón, Alberto; Puerto, Justo: Optimal arrangements of hyperplanes for SVM-based multiclass classification (2020)
- Blanquero, Rafael; Carrizosa, Emilio; Molero-Río, Cristina; Romero Morales, Dolores: Sparsity in optimal randomized classification trees (2020)
- Blömer, Johannes; Brauer, Sascha; Bujna, Kathrin; Kuntze, Daniel: How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models (2020)
- Bollwein, Ferdinand; Dahmen, Martin; Westphal, Stephan: A branch & bound algorithm to determine optimal cross-splits for decision tree induction (2020)
- Borchmann, Daniel; Hanika, Tom; Obiedkov, Sergei: Probably approximately correct learning of Horn envelopes from queries (2020)
- Borisyak, Maxim; Ryzhikov, Artem; Ustyuzhanin, Andrey; Derkach, Denis; Ratnikov, Fedor; Mineeva, Olga: ((1 + \varepsilon))-class classification: an anomaly detection method for highly imbalanced or incomplete data sets (2020)