Results 1 - 10 of 9,417

Mining Sequential Patterns

by Rakesh Agrawal, Ramakrishnan Srikant , 1995
"... We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empiri ..."
Abstract - Cited by 1568 (6 self) - Add to MetaCart
that both AprioriSome and AprioriAll scale linearly with the number of customer transactions. They also have excellent scale-up properties with respect to the number of transactions per customer and the number of items in a transaction.

Fast Algorithms for Mining Association Rules

by Rakesh Agrawal, Ramakrishnan Srikant , 1994
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known a ..."
Abstract - Cited by 3612 (15 self) - Add to MetaCart
with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.

Mining Sequential Patterns: Generalizations and Performance Improvements

by Ramakrishnan Srikant, Rakesh Agrawal - RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH , 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract - Cited by 759 (5 self) - Add to MetaCart
these generalized sequential patterns. Empirical evaluation using synthetic and real-life data indicates that GSP is much faster than the AprioriAll algorithm presented in [3]. GSP scales linearly with the number of data-sequences, and has very good scale-up properties with respect to the average data-sequence size.

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.

by David B Johnson , David A Maltz , Josh Broch - Perkins, Chapter , 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract - Cited by 764 (8 self) - Add to MetaCart
loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on

Good Error-Correcting Codes based on Very Sparse Matrices

by David J.C. MacKay , 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract - Cited by 750 (23 self) - Add to MetaCart
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties

Multiresolution grayscale and rotation invariant texture classification with local binary patterns

by Timo Ojala, Matti Pietikäinen, Topi Mäenpää - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2002
"... This paper presents a theoretically very simple, yet efficient, multiresolution approach to gray-scale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain ..."
Abstract - Cited by 1299 (39 self) - Add to MetaCart
that certain local binary patterns, termed "uniform," are fundamental properties of local image texture and their occurrence histogram is proven to be a very powerful texture feature. We derive a generalized gray-scale and rotation invariant operator presentation that allows for detecting the "

Social stigma and self-esteem: The selfprotective properties of stigma

by Jennifer Crocker, Brenda Major - Psychological Review , 1989
"... Although several psychological theories predict that members of stigmatized groups should have low global self-esteem, empirical research typically does not support this prediction. It is proposed here that this discrepancy may be explained by considering the ways in which membership in a stigmatize ..."
Abstract - Cited by 439 (12 self) - Add to MetaCart
dimensions on which their group fares poorly and value those dimensions on which their group excels. Evidence for each of these processes and their consequences for self-esteem and motivation is reviewed. Factors that moderate the use of these strategies and implications of this analysis for treatment

Indexing based on scale invariant interest points

by Krystian Mikolajczyk, Cordelia Schmid - In Proceedings of the 8th International Conference on Computer Vision , 2001
"... This paper presents a new method for detecting scale invariant interest points. The method is based on two recent results on scale space: 1) Interest points can be adapted to scale and give repeatable results (geometrically stable). 2) Local extrema over scale of normalized derivatives indicate the ..."
Abstract - Cited by 409 (32 self) - Add to MetaCart
descriptor. Our descriptors are, in addition, invariant to image rotation, to affine illumination changes and robust to small perspective deformations. Experimental results for indexing show an excellent performance up to a scale factor of 4 for a database with more than 5000 images. 1

Fast Algorithms For Mining Association Rules In Datamining

by P. Usharani , 2013
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known ..."
Abstract - Add to MetaCart
with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.

Fast Algorithms for Mining Association Rules

by Rekesh Agreewed, Remekrishnen Srikent
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Experiments with synthetic as well as real-life data show that these ..."
Abstract - Add to MetaCart
that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.
Results 1 - 10 of 9,417