295 search results - page 43 / 59 » Finding Interesting Rules from Large Sets of Discovered Asso... |
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
IJAR
2008
13 years 7 months ago
2008
We present Bayesian updating of an imprecise probability measure, represented by a class of precise multidimensional probability measures. Choice and analysis of our class are mot...
HICSS
2000
IEEE
14 years 9 days ago
2000
IEEE
People are able to determine whether or not a given document is interesting just by glancing through it. However, when asked to make explicit the rules upon which such a decision ...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
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...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...