Speeding Up Correlation Search for Binary Data
نویسندگان
چکیده
منابع مشابه
Speeding up correlation search for binary data
Finding the most interesting correlations in a collection of items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding correlated pairs instead of correlated itemsets in which all items are correlated with each other. Though some existing methods find correlated itemsets of any size, they suffer from both efficiency and effect...
متن کاملSpeeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...
متن کاملSpeeding Up the Search for Optimal Partitions
Numerical value range partitioning is an inherent part of inductive learning. In classification problems, a common partition ranking method is to use an attribute evaluation function to assign a goodness score to each candidate. Optimal cut point selection constitutes a potential efficiency bottleneck, which is often circumvented by using heuristic methods. This paper aims at improving the effi...
متن کاملSpeeding up the binary Gaussian process classification
Gaussian processes (GP) are attractive building blocks for many probabilistic models. Their drawbacks, however, are the rapidly increasing inference time and memory requirement alongside increasing data. The problem can be alleviated with compactly supported (CS) covariance functions, which produce sparse covariance matrices that are fast in computations and cheap to store. CS functions have pr...
متن کاملMatrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essential aspects for comparing association mining algorithms. We do a critical analysis of two previously existing methods, Apriori and FP-growth, emphasizing their strengths and weaknesses; and based on this analysis, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2149029