Sciweavers

1458 search results - page 35 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 1 days ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
DIAGRAMS
2004
Springer
14 years 1 months ago
Decision Diagrams in Machine Learning: An Empirical Study on Real-Life Credit-Risk Data
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
Christophe Mues, Bart Baesens, Craig M. Files, Jan...
VCIP
2003
147views Communications» more  VCIP 2003»
13 years 9 months ago
An objective method for combining multiple subjective data sets
International recommendations for subjective video quality assessment (e.g., ITU-R BT.500-11) include specifications for how to perform many different types of subjective tests. I...
Margaret H. Pinson, Stephen Wolf
AIME
2007
Springer
14 years 2 months ago
An Intelligent Aide for Interpreting a Patient's Dialysis Data Set
Many machines used in the modern hospital settings offer real time physiological monitoring. Haemodialysis machines combine a therapeutic treatment system integrated with sophistic...
Derek H. Sleeman, Nick Fluck, Elias Gyftodimos, La...
CAINE
2009
13 years 6 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...