Results 1 - 10 of 22,983

Mining Generalized Association Rules

by Ramakrishnan Srikant, Rakesh Agrawal , 1995
"... We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy th ..."
Abstract - Cited by 591 (7 self) - Add to MetaCart
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy

Beyond Market Baskets: Generalizing Association Rules To Dependence Rules

by Craig Silverstein, SERGEY BRIN , RAJEEV MOTWANI , 1998
"... One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: “A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market bask ..."
Abstract - Cited by 634 (6 self) - Add to MetaCart
One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: “A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market

Integrating classification and association rule mining

by Bing Liu, Wynne Hsu, Yiming Ma - In Proc of KDD , 1998
"... Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the database that satisfy some minimum support and minimum confidence constraints. For association rule mining, the target of di ..."
Abstract - Cited by 578 (21 self) - Add to MetaCart
Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the database that satisfy some minimum support and minimum confidence constraints. For association rule mining, the target

Amortized Efficiency of List Update and Paging Rules

by Daniel D. Sleator, Robert E. Tarjan , 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract - Cited by 824 (8 self) - Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study

Towards Generalized Rule-based Updates

by Yan Zhang, Norman Y. Foo - In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97 , 1997
"... Recent work on rule-based updates provided new frameworks for updates in more general knowledge domains [ Marek and Truszcz'nski, 1994; Baral, 1994; Przymusinski and Turner, 1995 ] . In this paper, we consider a simple generalization of rule-based updates where incomplete knowledge bases are al ..."
Abstract - Cited by 21 (7 self) - Add to MetaCart
Recent work on rule-based updates provided new frameworks for updates in more general knowledge domains [ Marek and Truszcz'nski, 1994; Baral, 1994; Przymusinski and Turner, 1995 ] . In this paper, we consider a simple generalization of rule-based updates where incomplete knowledge bases

Generalized rules for combination . . .

by J. A. Bilmes, K. Kirchhoff , 2003
"... Classifier combination has repeatedly been shown to provide significant improvements in performance for a wide range of classification tasks. In this paper, we focus on the problem of combining probability distributions generated by different classifiers. Specifically, we present a set of new combi ..."
Abstract - Add to MetaCart
combination rules that generalize the most commonly used combination functions, such as the mean, product, min, and max operations. These new rules have continuous and differentiable forms, and can thus not only be used for combination of independently trained classifiers, but also as objective functions in a

A Framework for Defining Logics

by Robert Harper , Furio Honsell, Gordon Plotkin - JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY , 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lof's system of ariti ..."
Abstract - Cited by 795 (42 self) - Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lof's system

the General Rules. ARTICLE 2

by unknown authors
"... The OIE Specialist Commissions shall each consist of a Bureau (composed of a President and two Vice‐Presidents) and three other members. ARTICLE 3 For each Specialist Commission, the Assembly elects the members of the Bureau individually and then the other three members, taking into account the need ..."
Abstract - Add to MetaCart
meetings of that Commission without adequate justification, the position held by that member shall be declared vacant by the Director General. In the case of a position falling or being declared vacant, the Assembly shall elect a new member to complete the term of office of the previous member. ARTICLE 4

A Strategic Model of Social and Economic Networks

by Matthew O. Jackson, Asher Wolinsky - CMSEMS Discussion Paper 1098, Northwestern University, revised , 1995
"... We study the stability and efficiency of social and economic networks, when selfinterested individuals can form or sever links. First, for two stylized models, we characterize the stable and efficient networks. There does not always exist a stable network that is efficient. Next, we show that this t ..."
Abstract - Cited by 664 (22 self) - Add to MetaCart
that this tension persists generally: to assure that there exists a stable network that is efficient, one is forced to allocate resources to nodes that are not responsible for any of the production. We characterize one such allocation rule: the equal split rule, and another rule that arises naturally from

Inflation Forecast Targeting: Implementing and Monitoring Inflation Targets

by Lars E. O. Svensson, Hans Dillén, Neil Ericsson, Jon Faust, Stanley Fischer, Marvin Goodfriend, Andrew Haldane, Hans Lindberg, David Mayes, Stefan Mellin, Frederic Mishkin, Stefan Palmqvist, Torsten Persson , 1996
"... Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how qui ..."
Abstract - Cited by 679 (48 self) - Add to MetaCart
quickly the inflation forecast is adjusted towards the inflation target. Money growth or exchange rate targeting is generally inferior than inflation targeting and leads to higher inflation variability. Commitment to `target rules' may be better than commitment to `instrument rules'.
Results 1 - 10 of 22,983