Sciweavers

2052 search results - page 374 / 411
» Direct Combination
Sort
View
FSKD
2006
Springer
298views Fuzzy Logic» more  FSKD 2006»
15 years 3 months ago
Risk Assessment of E-Commerce Projects Using Evidential Reasoning
The purpose of this study is to develop a decision making system to evaluate the risks in E-Commerce (EC) projects. Competitive software businesses have the critical task of assess...
Rashid Hafeez Khokhar, David A. Bell, Jiwen Guan, ...
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 3 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 3 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
15 years 3 months ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 3 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch