ReP USP - Resultado da busca

Trabalho de evento
Probabilistic combination of classifier and cluster ensembles for non-transductive learning (2013)
Acharya, Ayan; Hruschka, Eduardo Raul ; Ghosh, Joydeep; Sarwar, Badrul; Ruvini, Jean-David
Source: Proceedings. Conference titles: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ACHARYA, Ayan et al. Probabilistic combination of classifier and cluster ensembles for non-transductive learning. 2013, Anais.. Philadelphia: SIAM, 2013. Disponível em: https://doi.org/10.1137/1.9781611972832.32. Acesso em: 23 fev. 2026.
APA
Acharya, A., Hruschka, E. R., Ghosh, J., Sarwar, B., & Ruvini, J. -D. (2013). Probabilistic combination of classifier and cluster ensembles for non-transductive learning. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611972832.32
NLM
Acharya A, Hruschka ER, Ghosh J, Sarwar B, Ruvini J-D. Probabilistic combination of classifier and cluster ensembles for non-transductive learning [Internet]. Proceedings. 2013 ;[citado 2026 fev. 23 ] Available from: https://doi.org/10.1137/1.9781611972832.32
Vancouver
Acharya A, Hruschka ER, Ghosh J, Sarwar B, Ruvini J-D. Probabilistic combination of classifier and cluster ensembles for non-transductive learning [Internet]. Proceedings. 2013 ;[citado 2026 fev. 23 ] Available from: https://doi.org/10.1137/1.9781611972832.32
Trabalho de evento
A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets (2012)
Qiang, Zhu; Batista, Gustavo Enrique de Almeida Prado Alves; Rakthanmanon, Thanawin; Keogh, Eamonn
Source: Proceedings. Conference titles: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
QIANG, Zhu et al. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets. 2012, Anais.. Philadelphia: SIAM, 2012. Disponível em: http://siam.omnibooksonline.com/2012datamining/. Acesso em: 23 fev. 2026.
APA
Qiang, Z., Batista, G. E. de A. P. A., Rakthanmanon, T., & Keogh, E. (2012). A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets. In Proceedings. Philadelphia: SIAM. Recuperado de http://siam.omnibooksonline.com/2012datamining/
NLM
Qiang Z, Batista GE de APA, Rakthanmanon T, Keogh E. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets [Internet]. Proceedings. 2012 ;[citado 2026 fev. 23 ] Available from: http://siam.omnibooksonline.com/2012datamining/
Vancouver
Qiang Z, Batista GE de APA, Rakthanmanon T, Keogh E. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets [Internet]. Proceedings. 2012 ;[citado 2026 fev. 23 ] Available from: http://siam.omnibooksonline.com/2012datamining/
Trabalho de evento
A complexity-invariant distance measure for time series (2011)
Batista, Gustavo Enrique de Almeida Prado Alves; Wang, Xiaoyue; Keogh, Eamonn J.
Source: Proceedings. Conference titles: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BATISTA, Gustavo Enrique de Almeida Prado Alves e WANG, Xiaoyue e KEOGH, Eamonn J. A complexity-invariant distance measure for time series. 2011, Anais.. Philadelphia, PA: Society for Industrial and Applied Mathematics - SIAM, 2011. . Acesso em: 23 fev. 2026.
APA
Batista, G. E. de A. P. A., Wang, X., & Keogh, E. J. (2011). A complexity-invariant distance measure for time series. In Proceedings. Philadelphia, PA: Society for Industrial and Applied Mathematics - SIAM.
NLM
Batista GE de APA, Wang X, Keogh EJ. A complexity-invariant distance measure for time series. Proceedings. 2011 ;[citado 2026 fev. 23 ]
Vancouver
Batista GE de APA, Wang X, Keogh EJ. A complexity-invariant distance measure for time series. Proceedings. 2011 ;[citado 2026 fev. 23 ]
Trabalho de evento
On the comparisson of relative clustering validity criteria (2009)
Vendramin, Lucas; Campello, Ricardo José Gabrielli Barreto; Hruschka, Eduardo Raul
Source: Proceedings. Conference titles: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VENDRAMIN, Lucas e CAMPELLO, Ricardo José Gabrielli Barreto e HRUSCHKA, Eduardo Raul. On the comparisson of relative clustering validity criteria. 2009, Anais.. Philadelphia: SIAM, 2009. Disponível em: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf. Acesso em: 23 fev. 2026.
APA
Vendramin, L., Campello, R. J. G. B., & Hruschka, E. R. (2009). On the comparisson of relative clustering validity criteria. In Proceedings. Philadelphia: SIAM. Recuperado de http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf
NLM
Vendramin L, Campello RJGB, Hruschka ER. On the comparisson of relative clustering validity criteria [Internet]. Proceedings. 2009 ;[citado 2026 fev. 23 ] Available from: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf
Vancouver
Vendramin L, Campello RJGB, Hruschka ER. On the comparisson of relative clustering validity criteria [Internet]. Proceedings. 2009 ;[citado 2026 fev. 23 ] Available from: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf

USP Schools

ReP

Filtros

Authors