Comparison with parametric optimization in credit card fraud detection (2008)
- Authors:
- Autor USP: LAGO, ALAIR PEREIRA DO - IME
- Unidade: IME
- DOI: 10.1109/ICMLA.2008.59
- Subjects: REDES NEURAIS; SISTEMAS IMUNOLÓGICOS ARTIFICIAIS; INFERÊNCIA BAYESIANA E REDES DE CRENÇA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2008
- Source:
- Título: Proceedings
- Conference titles: International Conference on Machine Learning and Applications - ICMLA
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
GADI, Manoel Fernando Alonso e WANG , Xidi e LAGO, Alair Pereira do. Comparison with parametric optimization in credit card fraud detection. 2008, Anais.. Piscataway: IEEE, 2008. Disponível em: https://doi.org/10.1109/ICMLA.2008.59. Acesso em: 15 abr. 2026. -
APA
Gadi, M. F. A., Wang , X., & Lago, A. P. do. (2008). Comparison with parametric optimization in credit card fraud detection. In Proceedings. Piscataway: IEEE. doi:10.1109/ICMLA.2008.59 -
NLM
Gadi MFA, Wang X, Lago AP do. Comparison with parametric optimization in credit card fraud detection [Internet]. Proceedings. 2008 ;[citado 2026 abr. 15 ] Available from: https://doi.org/10.1109/ICMLA.2008.59 -
Vancouver
Gadi MFA, Wang X, Lago AP do. Comparison with parametric optimization in credit card fraud detection [Internet]. Proceedings. 2008 ;[citado 2026 abr. 15 ] Available from: https://doi.org/10.1109/ICMLA.2008.59 - A new algorithm for sparse suffix trees
- On the Burnside semigroups xn = xn+m
- Lossless filter for multiple repeats with bounded edit distance
- Fraud detection in reputation systems in e-markets using logistic regression
- Stable two-sided matching of slot allocation in airport collaborative decision making
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Local groups in free groupoids satisfying certain monoid identities
- Lossless filter for multiple repetitions with Hamming distance
- On the Burnside semigroups 'x POT.n' ='x POT.n+m'
- Maximal groups in free Burnside semigroups
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
