Approximate reasoning applied to unsupervised database mining
A computational approach is shown for unsupervised, reactive, database mining. This approach is dependent on soft computing techniques. Database mining seeks to discover noteworthy, unrecognized associations between database items. A novel approach is suggested for unsupervised search controlled by...
Saved in:
Published in | International journal of intelligent systems Vol. 12; no. 5; pp. 391 - 414 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
New York
Wiley Subscription Services, Inc., A Wiley Company
01.05.1997
Wiley |
Subjects | |
Online Access | Get full text |
ISSN | 0884-8173 1098-111X |
DOI | 10.1002/(SICI)1098-111X(199705)12:5<391::AID-INT3>3.0.CO;2-I |
Cover
Loading…
Summary: | A computational approach is shown for unsupervised, reactive, database mining. This approach is dependent on soft computing techniques. Database mining seeks to discover noteworthy, unrecognized associations between database items. A novel approach is suggested for unsupervised search controlled by dissonance reduction. Both crisp and noncrisp data are subject to discovery. Another aspect of uncertainty is the metric that controls discovery. Issues involve: coherence measures, granularization, user intelligible results, unsupervised recognition of interesting results, and concept equivalent formation. © 1997 John Wiley & Sons, Inc. |
---|---|
Bibliography: | ArticleID:INT3 ark:/67375/WNG-X5XTDVM2-R istex:1B373253F8613C006ED942AFDE29A967E8E90444 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0884-8173 1098-111X |
DOI: | 10.1002/(SICI)1098-111X(199705)12:5<391::AID-INT3>3.0.CO;2-I |