Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Autor: Ramakrishnan, Raghu (Comienzo)
2 registros cumplieron la condición especificada en la base de información BIBCYT. ()
Registro 1 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Bradley, Paul paulb@gigimine.com
Oprima aquí para enviar un correo electrónico a esta dirección ; Gehrke, Johannes johannes@cs.cornell.edu
Oprima aquí para enviar un correo electrónico a esta dirección; Ramakrishnan, Raghu raghu@cs.wisc.edu
Oprima aquí para enviar un correo electrónico a esta dirección; Srikant, Ramakrishnan srikant@us.ibm.com
Oprima aquí para enviar un correo electrónico a esta dirección
Título: Scaling mining algorithms to large databases
Páginas/Colación: pp.38-43.; 28 cm.; il.
Communications of the ACM Vol. 45, no. 8 August 2002
Información de existenciaInformación de existencia

Resumen
Data mining is increasingly recognized as a key to analyzing, digesting and understanding the flood of digital data collected by business, government and scientific applications. Achieving this goal requires the scaling of mining algorithms to very large databases. Many classic mining algorithms require multiple database scans and random access to database records. Research as of August 1, 2002 focuses on overcoming limitations imposed when it is costly or impossible to scan large databases multiple times or access records at random. Predictive modeling is often a high-level goal of data mining in practice. There are two classes of algorithms namely decision tree methods and support vector machines. Decision trees are especially attractive in data mining environments since human analysts readily comprehend the resulting models. Their construction does not require an analyst to provide input parameters. Prior knowledge about the data is also not needed. Decision tree construction algorithms consist of two stages namely tree building and pruning. Support vector machines are other powerful and popular approaches to predictive modeling with success in a number of applications, including handwritten digit recognition, charmed quark detection, face detection and text categorization.

Registro 2 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Agrawal, Rakesh ; Brewer, Eric A. ; Gehrke, Johannes johannes@cs.cornell.edu
Oprima aquí para enviar un correo electrónico a esta dirección; Ramakrishnan, Raghu raghu@cs.wisc.edu
Oprima aquí para enviar un correo electrónico a esta dirección; Ailamaki, Anastasia ; Bernstein, Philip A. ; Carey , Michael J. ; Chaudhuri, Surajid ; Doan, Anhai ; Florescu, Daniela ; Franklin, Michael J. ; Garcia-Molina, Hector ; Gruenwald, Le ; Haas, Laura M. ; Halevy, Alon Y. ; Hellerstein, Joseph M. ; Ioannidis, Yannis E. ; Korth, Hank F. ; Kossmann, Donald ; Madden, Samuel ; Magoulas, Roger ; Ooi, Beng Chin ; O`Reilly, Tim ; Sarawagi, Sunita ; Stonebraker, Michael ; Szalay, Alexander S. ; Weikum, Gerhard
Título: The Claremont Report on Database Research
Páginas/Colación: p. 56
Fecha: Junio
Communications of the ACM Vol. 52, no.6 June 2009
Información de existenciaInformación de existencia

Resumen
A group of database researchers, architects, users, and pundits met in May 2008 at the Claremont Resort in Berkeley, CA, to discuss the state of database it search and its effects on practice. This was the seventh meeting of this sort over the past 20 years and was distinguished by a broad consensus that the database community is at a turning point in its history, due to both an explosion of data and usage scenarios and major shifts in computing hardware and platforms. This article explores the conclusions of this self-assessment. The theme of the Claremont meeting was that database research and the data-management industry are at a turning point, with unusually rich opportunities for technical advances, intellectual achievement, entrepreneurship, and benefits for science and society. Given the large number of opportunities, it is important for the database research community to address issues that maximize relevance within the field, across computing, and in external fields as well.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (3.144.189.177)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
3.144.189.177 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información BIBCYT: 7.0.0 (con listas invertidas [2.0])

Cliente: 3.144.189.177
Salida con Javascript


** Back-end Alejandría BE 7.0.7b0 *