centro de Ciecias Humanas y Sociales
    > Portada > Cybermetría > Fuentes > Todas las fuentes    
Líneas de investigación
Introducción a Internet
Internet especializado
Búsqueda y Recuperacion de Información
Internet Invisible
Otras Actividades
Trabaja con nosotros
Artículos de todas las fuentes
Primero | Previo | Siguiente | Último | Artículos 11 al 15 de 518

Spiliopoulou, Myra; Faulstich, Lukas C.; Winkler, Karsten. (1999). "A data miner analyzing the navigational behaviour of web users." [Comunicación]. Workshop on Machine Learning in User Modelling of the ACAI International Conference, Julio1999, ():.
URL: http://viror.wiwi.uni-karlsruhe.de/webmining/bib/pdf/Spiliopoulou1999b.pdf      
Materias:  Minería de datos web 

"Web site design is currently based on thorough investigations about the interests of web site visitors and on less investigated assumptions about their exact behaviour. Concrete knowledge on the way visitors navigate in a web site could prevent disorientation and help owners in placing important information exactly where the visitors look for it. Our Web Utilization Miner tool can provide such knowledge."

Karypis, George; Kumar, Vipin. (1998). "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs." [Artículo]. SIAM Journal of Scientific Computing, 1998, 20(1):359-392.
URL: http://epubs.siam.org/sam-bin/dbq/article/28799      
Materias:  Minería de datos web 

"Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. of the 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993, 445--452; Hendrickson and Leland, A Multilevel Algorithm for Partitioning Graphs, Tech. report SAND 93-1301, Sandia National Laboratories, Albuquerque, NM, 1993]. From the early work it was clear that multilevel techniques held great promise; however, it was not known if they can be made to consistently produce high quality partitions for graphs arising in a wide range of application domains. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In particular, we present a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of the size of the final partition obtained after multilevel refinement. We also present a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening. We test our scheme on a large number of graphs arising in various domains including finite element methods, linear programming, VLSI, and transportation. Our experiments show that our scheme produces partitions that are consistently better than those produced by spectral partitioning schemes in substantially smaller time. Also, when our scheme is used to compute fill-reducing orderings for sparse matrices, it produces orderings that have substantially smaller fill than the widely used multiple minimum degree algorithm."

Garfield, Eugene (1978). "A festschrift for Bjorn Tell: How will new technology change the characteristics of libraries and their users?" [Capítulo]. Knowledge and Development Reshaping Library and Information Services for the World of Tomorrow, 1978, ():.
URL: http://www.garfield.library.upenn.edu/essays/v4p019y1979-80.pdf      
Materias:  Análisis de citas   |  Eugene Garfield 

"It is difficult to say in exactly what ways new technology will transform libraries in future years. Will anyone need libraries as we now know (hem if, as predicted, the general popula-tion will soon ha~e on-line searching capability in their homes? What kinds of library services will be needed to acquire, store, retrie~e, and disseminate materials stored (m disks or through holographic methods? And what kinds of librarians will be best suited to manage the information centers of tomorrow. what form they may take:) These and other questions are discussed. Although the outlook is generally optimistic, a realistic note of caution is also introduced."

Wong, Johnny S. K.; Nayar, Rishi; Mikler, Armin R. (1998). "A framework for a World Wide Web-based Data Mining system." [Artículo]. Journal of Network and Computer Applications, Julio1998, 21(3):163-185.
URL: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6WKB-45J4Y4Y-1-1&_cdi=6902&_orig=browse&_coverDate=07%2F31%2F1998&_sk=999789996&view=c&wchp=dGLbVtz-lSzBk&_acct=C000048559&_version=1&_userid=956552&md5=cd19a702930633b0de0a7b855cf1e78b&ie=f.pdf      
Materias:  Minería de datos web 

"The phenomenal growth of the World Wide Web (WWW) introduces new vistas for trade and commerce. In addition to overcoming the difficulties of distances, cultures and languages, the WWW provides another important business resource: information. Spurred on by the development of better data storage and retrieval techniques, companies are beginning to provide more information about themselves and their activities. This widespread information dissemination necessitates the development of tools which can process it. The application of machine learning algorithms to this vast quantity of data can yield useful information, which can be used for individual and corporate decision support. One example of many possible applications of Data Mining, the system described in this paper, deals with stock-market data available on certain Web-sites. It classifies these stocks asbuyorsellusing the decision tree technique. The user interaction is through a Web browser, which makes the Web-based nature of the data gathering and processing transparent to the user. A number of experiments are conducted to gauge the performance of the classification."

Pack, Thomas and Pemberton, Jeff. (1999). "A harbinger of change: the cutting edge library at the Los Alamos National Laboratory." [Artículo]. Online Magazine, Marzo1999, 23(2):34-42.

Materias:  Comunicación científica en el web 

    Copyright © 2000-2008 CybermetricsLab, CCHS - CSIC    [ Todos los derechos reservados ]