Sciweavers

374 search results - page 36 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
ICDM
2003
IEEE
91views Data Mining» more  ICDM 2003»
15 years 3 months ago
MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations
In the literature of data mining, many different algorithms for association rule mining have been proposed. However, there is relatively little study on how association rules can ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang
ICLP
1999
Springer
15 years 2 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
15 years 11 months ago
Discovering Conditional Functional Dependencies
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
Wenfei Fan, Floris Geerts, Laks V. S. Lakshmanan, ...
MICS
2007
100views more  MICS 2007»
14 years 9 months ago
A New Method for Real Root Isolation of Univariate Polynomials
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
Ting Zhang, Bican Xia
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 3 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...