• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 12,090
Next 10 →

Analysis of Recommendation Algorithms for E-Commerce

by Badrul Sarwar, George Karypis, Joseph Konstan, John Rield , 2000
"... Recommender systems apply statistical and knowledge discovery techniques to the problem of making product recommendations during a live customer interaction and they are achieving widespread success in E-Commerce nowadays. In this paper, we investigate several techniques for analyzing large-scale pu ..."
Abstract - Cited by 523 (22 self) - Add to MetaCart
Recommender systems apply statistical and knowledge discovery techniques to the problem of making product recommendations during a live customer interaction and they are achieving widespread success in E-Commerce nowadays. In this paper, we investigate several techniques for analyzing large

From Data Mining to Knowledge Discovery in Databases.

by Usama Fayyad , Gregory Piatetsky-Shapiro , Padhraic Smyth - AI Magazine, , 1996
"... ■ Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in database ..."
Abstract - Cited by 538 (0 self) - Add to MetaCart
of digital data. These theories and tools are the subject of the emerging field of knowledge discovery in databases (KDD). At an abstract level, the KDD field is concerned with the development of methods and techniques for making sense of data. The basic problem addressed by the KDD process is one of mapping

The Ant System: Optimization by a colony of cooperating agents

by Marco Dorigo, Vittorio Maniezzo, Alberto Colorni - IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS-PART B , 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract - Cited by 1300 (46 self) - Add to MetaCart
computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed

SPADE: An efficient algorithm for mining frequent sequences

by Mohammed J. Zaki - Machine Learning , 2001
"... Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original proble ..."
Abstract - Cited by 437 (16 self) - Add to MetaCart
Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original

Automatically validating temporal safety properties of interfaces

by Thomas Ball, Sriram K. Rajamani , 2001
"... We present a process for validating temporal safety properties of software that uses a well-defined interface. The process requires only that the user state the property of interest. It then automatically creates abstractions of C code using iterative refinement, based on the given property. The pro ..."
Abstract - Cited by 433 (21 self) - Add to MetaCart
. The process is realized in the SLAM toolkit, which consists of a model checker, predicate abstraction tool and predicate discovery tool. We have applied the SLAM toolkit to a number of Windows NT device drivers to validate critical safety properties such as correct locking behavior. We have found

The processing-speed theory of adult age differences in cognition

by Timothy A. Salthouse - Psychological Review , 1996
"... A theory is proposed to account for some of the age-related differences reported in measures of Type A or fluid cognition. The central hypothesis in the theory is that increased age in adulthood is associated with a decrease in the speed with which many processing operations can be executed and that ..."
Abstract - Cited by 416 (2 self) - Add to MetaCart
the products of early processing may no longer be available when later processing is complete (simultaneity). Several types of evidence, such as the discovery of con-siderable shared age-related variance across various measures of speed and large attenuation of the age-related influences on cognitive measures

New Algorithms for Fast Discovery of Association Rules

by Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li - In 3rd Intl. Conf. on Knowledge Discovery and Data Mining , 1997
"... Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. In this paper we present efficient algorithms for the discovery ..."
Abstract - Cited by 397 (26 self) - Add to MetaCart
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. In this paper we present efficient algorithms

Human DNA methylomes at base resolution show widespread epigenomic differences.

by Ryan Lister , Mattia Pelizzola , Robert H Dowen , R David Hawkins , Gary Hon , Julian Tonti-Filippini , Joseph R Nery , Leonard Lee , Zhen Ye , Que-Minh Ngo , Lee Edsall , Jessica Antosiewicz-Bourget , Ron Stewart , Victor Ruotti , A Harvey Millar , James A Thomson , Bing Ren , Joseph R Ecker - Nature, , 2009
"... DNA cytosine methylation is a central epigenetic modification that has essential roles in cellular processes including genome regulation, development and disease. Here we present the first genome-wide, single-base-resolution maps of methylated cytosines in a mammalian genome, from both human embryo ..."
Abstract - Cited by 401 (6 self) - Add to MetaCart
DNA cytosine methylation is a central epigenetic modification that has essential roles in cellular processes including genome regulation, development and disease. Here we present the first genome-wide, single-base-resolution maps of methylated cytosines in a mammalian genome, from both human

Mining: Information and Pattern Discovery on the World Wide Web

by R. Cooley, B. Mobasher, J. Srivastava - In: Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence (ICTAI , 1997
"... Application of data mining techniques to the World Wide Web, referred to as Web mining, has been the focus of several recent research projects and papers. However, there is no established vocabulary, leading to confusion when comparing research efforts. The term Web mining has been used in two disti ..."
Abstract - Cited by 372 (21 self) - Add to MetaCart
distinct ways. The first, called Web content mining in this paper, is the process of information discovery from sources across the World Wide Web. The second, called Web mage mining, is the process of mining for user browsing and access patterns. In this paper we define Web mining and present an overview

Variable Neighborhood Search

by Pierre Hansen, Nenad Mladenovic , 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract - Cited by 355 (26 self) - Add to MetaCart
are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computer-assisted discovery of conjectures in graph theory.
Next 10 →
Results 1 - 10 of 12,090
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University