Literatura científica selecionada sobre o tema "Approximation de Nyström"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Approximation de Nyström".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Approximation de Nyström"
Ding, Lizhong, Yong Liu, Shizhong Liao, Yu Li, Peng Yang, Yijie Pan, Chao Huang, Ling Shao e Xin Gao. "Approximate Kernel Selection with Strong Approximate Consistency". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julho de 2019): 3462–69. http://dx.doi.org/10.1609/aaai.v33i01.33013462.
Texto completo da fonteWang, Ling, Hongqiao Wang e Guangyuan Fu. "Multi-Nyström Method Based on Multiple Kernel Learning for Large Scale Imbalanced Classification". Computational Intelligence and Neuroscience 2021 (13 de junho de 2021): 1–11. http://dx.doi.org/10.1155/2021/9911871.
Texto completo da fonteZhang, Kai, e James T. Kwok. "Density-Weighted Nyström Method for Computing Large Kernel Eigensystems". Neural Computation 21, n.º 1 (janeiro de 2009): 121–46. http://dx.doi.org/10.1162/neco.2009.11-07-651.
Texto completo da fonteDíaz de Alba, Patricia, Luisa Fermo e Giuseppe Rodriguez. "Solution of second kind Fredholm integral equations by means of Gauss and anti-Gauss quadrature rules". Numerische Mathematik 146, n.º 4 (18 de novembro de 2020): 699–728. http://dx.doi.org/10.1007/s00211-020-01163-7.
Texto completo da fonteRudi, Alessandro, Leonard Wossnig, Carlo Ciliberto, Andrea Rocchetto, Massimiliano Pontil e Simone Severini. "Approximating Hamiltonian dynamics with the Nyström method". Quantum 4 (20 de fevereiro de 2020): 234. http://dx.doi.org/10.22331/q-2020-02-20-234.
Texto completo da fonteTrokicić, Aleksandar, e Branimir Todorović. "Constrained spectral clustering via multi–layer graph embeddings on a grassmann manifold". International Journal of Applied Mathematics and Computer Science 29, n.º 1 (1 de março de 2019): 125–37. http://dx.doi.org/10.2478/amcs-2019-0010.
Texto completo da fonteCai, Difeng, e Panayot S. Vassilevski. "Eigenvalue Problems for Exponential-Type Kernels". Computational Methods in Applied Mathematics 20, n.º 1 (1 de janeiro de 2020): 61–78. http://dx.doi.org/10.1515/cmam-2018-0186.
Texto completo da fonteHe, Li, e Hong Zhang. "Kernel K-Means Sampling for Nyström Approximation". IEEE Transactions on Image Processing 27, n.º 5 (maio de 2018): 2108–20. http://dx.doi.org/10.1109/tip.2018.2796860.
Texto completo da fonteWang, Shiyuan, Lujuan Dang, Guobing Qian e Yunxiang Jiang. "Kernel recursive maximum correntropy with Nyström approximation". Neurocomputing 329 (fevereiro de 2019): 424–32. http://dx.doi.org/10.1016/j.neucom.2018.10.064.
Texto completo da fonteLaguardia, Anna Lucia, e Maria Grazia Russo. "A Nyström Method for 2D Linear Fredholm Integral Equations on Curvilinear Domains". Mathematics 11, n.º 23 (3 de dezembro de 2023): 4859. http://dx.doi.org/10.3390/math11234859.
Texto completo da fonteTeses / dissertações sobre o assunto "Approximation de Nyström"
Cherfaoui, Farah. "Echantillonnage pour l'accélération des méthodes à noyaux et sélection gloutonne pour les représentations parcimonieuses". Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0256.
Texto completo da fonteThe contributions of this thesis are divided into two parts. The first part is dedicated to the acceleration of kernel methods and the second to optimization under sparsity constraints. Kernel methods are widely known and used in machine learning. However, the complexity of their implementation is high and they become unusable when the number of data is large. We first propose an approximation of Ridge leverage scores. We then use these scores to define a probability distribution for the sampling process of the Nyström method in order to speed up the kernel methods. We then propose a new kernel-based framework for representing and comparing discrete probability distributions. We then exploit the link between our framework and the maximum mean discrepancy to propose an accurate and fast approximation of the latter. The second part of this thesis is devoted to optimization with sparsity constraint for signal optimization and random forest pruning. First, we prove under certain conditions on the coherence of the dictionary, the reconstruction and convergence properties of the Frank-Wolfe algorithm. Then, we use the OMP algorithm to reduce the size of random forests and thus reduce the size needed for its storage. The pruned forest consists of a subset of trees from the initial forest selected and weighted by OMP in order to minimize its empirical prediction error
Li, Jun 1977. "A computational model for the diffusion coefficients of DNA with applications". Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-05-1098.
Texto completo da fontetext
Capítulos de livros sobre o assunto "Approximation de Nyström"
Hutchings, Matthew, e Bertrand Gauthier. "Local Optimisation of Nyström Samples Through Stochastic Gradient Descent". In Machine Learning, Optimization, and Data Science, 123–40. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-25599-1_10.
Texto completo da fonteFu, Zhouyu. "Optimal Landmark Selection for Nyström Approximation". In Neural Information Processing, 311–18. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12640-1_38.
Texto completo da fonteLi, Hongyu, e Lin Zhang. "Dynamic Subspace Update with Incremental Nyström Approximation". In Computer Vision – ACCV 2010 Workshops, 384–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22819-3_39.
Texto completo da fonteZhang, Huaxiang, Zhichao Wang e Linlin Cao. "Fast Nyström for Low Rank Matrix Approximation". In Advanced Data Mining and Applications, 456–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35527-1_38.
Texto completo da fonteFrammartino, Carmelina. "A Nyström Method for Solving a Boundary Value Problem on [0, ∞)". In Approximation and Computation, 311–25. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-6594-3_20.
Texto completo da fonteJia, Hongjie, Liangjun Wang e Heping Song. "Large-Scale Spectral Clustering with Stochastic Nyström Approximation". In IFIP Advances in Information and Communication Technology, 26–34. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46931-3_3.
Texto completo da fonteAllouch, Chafik, Ikram Hamzaoui e Driss Sbibih. "Richardson Extrapolation of Nyström Method Associated with a Sextic Spline Quasi-Interpolant". In Mathematical and Computational Methods for Modelling, Approximation and Simulation, 105–19. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94339-4_5.
Texto completo da fonteYun, Jeong-Min, e Seungjin Choi. "Nyström Approximations for Scalable Face Recognition: A Comparative Study". In Neural Information Processing, 325–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24958-7_38.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Approximation de Nyström"
Giffon, Luc, Stephane Ayache, Thierry Artieres e Hachem Kadri. "Deep Networks with Adaptive Nyström Approximation". In 2019 International Joint Conference on Neural Networks (IJCNN). IEEE, 2019. http://dx.doi.org/10.1109/ijcnn.2019.8851711.
Texto completo da fonteZhang, Kai, Ivor W. Tsang e James T. Kwok. "Improved Nyström low-rank approximation and error analysis". In the 25th international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1390156.1390311.
Texto completo da fonteMathur, Anant, Sarat Moka e Zdravko Botev. "Column Subset Selection and Nyström Approximation via Continuous Optimization". In 2023 Winter Simulation Conference (WSC). IEEE, 2023. http://dx.doi.org/10.1109/wsc60868.2023.10407416.
Texto completo da fonteMünch, Maximilian, Katrin Sophie Bohnsack, Alexander Engelsberger, Frank-Michael Schleif e Thomas Villmann. "Sparse Nyström Approximation for Non-Vectorial Data Using Class-informed Landmark Selection". In ESANN 2023 - European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Louvain-la-Neuve (Belgium): Ciaco - i6doc.com, 2023. http://dx.doi.org/10.14428/esann/2023.es2023-136.
Texto completo da fontePatel, Raajen, Tom Goldstein, Eva Dyer, Azalia Mirhoseini e Richard Baraniuk. "Deterministic Column Sampling for Low-Rank Matrix Approximation: Nyström vs. Incomplete Cholesky Decomposition". In Proceedings of the 2016 SIAM International Conference on Data Mining. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2016. http://dx.doi.org/10.1137/1.9781611974348.67.
Texto completo da fonteLee, Jieun, e Yoonsik Choe. "Graph-Regularized Fast Low-Rank Matrix Approximation Using The NystrÖM Method for Clustering". In 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP). IEEE, 2018. http://dx.doi.org/10.1109/mlsp.2018.8517034.
Texto completo da fonteDereziński, Michał, Rajiv Khanna e Michael W. Mahoney. "Improved Guarantees and a Multiple-descent Curve for Column Subset Selection and the Nystrom Method (Extended Abstract)". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/647.
Texto completo da fonteAhmed, Hesham Ibrahim, Wan Qun, Ding Xue-ke e Zhou Zhi-ping. "Squared distance matrix completion through Nystrom approximation". In 2016 22nd Asia-Pacific Conference on Communications (APCC). IEEE, 2016. http://dx.doi.org/10.1109/apcc.2016.7581449.
Texto completo da fonteHou, Bo-Jian, Lijun Zhang e Zhi-Hua Zhou. "Storage Fit Learning with Unlabeled Data". In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/256.
Texto completo da fontePatel, Lokendra Singh, Suman Sana e S. P. Ghrera. "Efficient Nystrom method for low rank approximation and error analysis". In 2015 Third International Conference on Image Information Processing (ICIIP). IEEE, 2015. http://dx.doi.org/10.1109/iciip.2015.7414831.
Texto completo da fonte