Research and Development in Knowledge Discovery and Data Mining
Editat de Xindong Wu, Ramamohanarao Kotagiri, Kevin B. Korben Limba Engleză Paperback – 8 apr 1998
Preț: 328.94 lei
Preț vechi: 411.17 lei
-20%
Puncte Express: 493
Preț estimativ în valută:
58.21€ • 68.04$ • 50.54£
58.21€ • 68.04$ • 50.54£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540643838
ISBN-10: 3540643834
Pagini: 452
Ilustrații: XVIII, 434 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540643834
Pagini: 452
Ilustrații: XVIII, 434 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Knowledge acquisition for goal prediction in a multi-user adventure game.- Hybrid data mining systems: The next generation.- Discovering case knowledge using data mining.- Discovery of association rules over ordinal data: A new and faster algorithm and its application to basket analysis.- Effect of data skewness in parallel mining of association rules.- Trend directed learning: A case study.- Interestingness of discovered association rules in terms of neighborhood-based unexpectedness.- Point estimation using the Kullback-Leibler loss function and MML.- Single factor analysis in MML mixture modelling.- Discovering associations in spatial data — An efficient medoid based approach.- Data mining using dynamically constructed recurrent fuzzy neural networks.- CCAIIA: Clustering categorical attributes into interesting association rules.- Selective materialization: An efficient method for spatial data cube construction.- Mining market basket data using share measures and characterized itemsets.- Automatic visualization method for visual data mining.- Rough-set inspired approach to knowledge discovery in business databases.- Representative association rules.- Identifying relevant databases for multidatabase mining.- Minimum message length segmentation.- Bayesian classification trees with overlapping leaves applied to credit-scoring.- Contextual text representation for unsupervised knowledge discovery in texts.- Treatment of missing values for association rules.- Mining regression rules and regression trees.- Mining algorithms for sequential patterns in parallel : Hash based approach.- Wavelet transform in similarity paradigm.- Improved rule discovery performance on uncertainty.- Feature mining and mapping of collinear data.- Knowledge discovery in discretionary legaldomains.- Scaling up the rule generation of C4.5.- Data mining based on the generalization distribution table and rough sets.- Constructing personalized information agents.- Towards real time discovery from distributed information sources.- Constructing conceptual scales in formal concept analysis.- The hunter and the hunted — Modelling the relationship between web pages and search engines.- An efficient global discretization method.- Learning user preferences on the WEB.- Using rough sets for knowledge discovery in the development of a decision support system for issuing smog alerts.- Empirical results on data dimensionality reduction using the divided self-organizing map.- Mining association rules with linguistic cloud models.- A data mining approach for query refinement.- CFMD: A conflict-free multivariate discretization algorithm.- Characteristic rule induction algorithm for data mining.- Data-mining massive time series astronomical data sets — A case study.- Multiple databases, partial reasoning, and knowledge discovery.- Design recovery with data mining techniques.- The CLARET algorithm.- LRTree: A hybrid technique for classifying myocardial infarction data containing unknown attribute values.- Modelling decision tables from data.- A classification and relationship extraction scheme for relational databases based on fuzzy logic.- Mining association rules for estimation and prediction.- Rule generalization by condition combination.