Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings

Overview

This book constitutes the refereed proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001, held in Hong Kong, China in April 2001.
The 38 revised full papers and 22 short papers presented were carefully reviewed and selected from a total of 152 submissions. The book offers topical sections on Web mining, text mining, applications and tools, concept hierarchies, feature selection, interestingness, sequence mining, spatial and temporal ...

See more details below
Paperback (2001)
$139.30
BN.com price
(Save 17%)$169.00 List Price
Other sellers (Paperback)
  • All (14) from $20.00   
  • New (10) from $66.38   
  • Used (4) from $20.00   
Sending request ...

Overview

This book constitutes the refereed proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001, held in Hong Kong, China in April 2001.
The 38 revised full papers and 22 short papers presented were carefully reviewed and selected from a total of 152 submissions. The book offers topical sections on Web mining, text mining, applications and tools, concept hierarchies, feature selection, interestingness, sequence mining, spatial and temporal mining, association mining, classification and rule induction, clustering, and advanced topics and new methods.

Read More Show Less

Product Details

Table of Contents

Incompleteness in Data Mining 1
Mining E-Commerce Data: The Good, the Bad, and the Ugly 2
Seamless Integration of Data Mining with DBMS and Applications 3
Applying Pattern Mining to Web Information Extraction 4
Empirical Study of Recommender Systems Using Linear Classifiers 16
iJADE eMiner - A Web-Based Mining Agent Based on Intelligent Java Agent Development Environment (iJADE) on Internet Shopping 28
A Characterized Rating Recommend System 41
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents 47
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification 53
Predictive Self-Organizing Networks for Text Categorization 66
Meta-learning Models for Automatic Textual Document Categorization 78
Efficient Algorithms for Concept Space Construction 90
Topic Detection, Tracking, and Trend Analysis Using Self-Organizing Neural Networks 102
Automatic Hypertext Construction through a Text Mining Approach by Self-Organizing Maps 108
Semantic Expectation-Based Causation Knowledge Extraction: A Study on Hong Kong Stock Movement Analysis 114
A Toolbox Approach to Flexible and Efficient Data Mining 124
Determining Progression in Glaucoma Using Visual Fields 136
Seabreeze Prediction Using Bayesian Networks 148
Semi-supervised Learning in Medical Image Database 154
On Application of Rough Data Mining Methods to Automatic Construction of Student Models 161
Concept Approximation in Concept Lattice 167
Generating Concept Hierarchies/Networks: Mining Additional Semantics in Relational Data 174
Representing Large Concept Hierarchies Using Lattice Data Structure 186
Feature Selection for Temporal Health Records 198
Boosting the Performance of Nearest Neighbour Methods with Feature Selection 210
Feature Selection for Meta-learning 222
Efficient Mining of Niches and Set Routines 234
Evaluation of Interestingness Measures for Ranking Discovered Knowledge 247
Peculiarity Oriented Mining and Its Application for Knowledge Discovery in Amino-Acid Data 260
Mining Sequence Patterns from Wind Tunnel Experimental Data for Flight Control 270
Scalable Hierarchical Clustering Method for Sequences of Categorical Values 282
FFS - An I/O-Efficient Algorithm for Mining Frequent Sequences 294
Sequential Index Structure for Content-Based Retrieval 306
The S[subscript 2]-Tree: An Index Structure for Subsequence Matching of Spatial Objects 312
Temporal Data Mining Using Hidden Markov-Local Polynomial Models 324
Patterns Discovery Based on Time-Series Decomposition 336
Criteria on Proximity Graphs for Boundary Extraction and Spatial Clustering 348
Micro Similarity Queries in Time Series Database 358
Mining Optimal Class Association Rule Set 364
Generating Frequent Patterns with the Frequent Pattern List 376
User-Defined Association Mining 387
Direct and Incremental Computing of Maximal Covering Rules 400
Towards Efficient Data Re-mining (DRM) 404
Data Allocation Algorithm for Parallel Association Rule Discovery 413
Direct Domain Knowledge Inclusion in the PA3 Rule Induction Algorithm 421
Hierarchical Classification of Documents with Error Control 433
An Efficient Data Compression Approach to the Classification Task 444
Combining the Strength of Pattern Frequency and Distance for Classification 455
A Scalable Algorithm for Rule Post-pruning of Large Decision Trees 467
Optimizing the Induction of Alternating Decision Trees 477
Building Behaviour Knowledge Space to Make Classification Decision 488
Efficient Hierarchical Clustering Algorithms Using Partially Overlapping Partitions 495
A Rough Set-Based Clustering Method with Modification of Equivalence Relations 507
Importance of Individual Variables in the k-Means Algorithm 513
A Hybrid Approach to Clustering in Very Large Databases 519
A Similarity Indexing Method for the Data Waterhousing - Bit-Wise Indexing Method 525
Rule Reduction over Numerical Attributes in Decision Trees Using Multilayer Perceptron 538
Knowledge Acquisition from Both Human Expert and Data 550
Neighborhood Dependencies for Prediction 562
Learning Bayesian Networks with Hidden Variables Using the Combination of EM and Evolutionary Algorithms 568
Interactive Construction of Decision Trees 575
An Improved Learning Algorithm for Augmented Naive Bayes 581
Generalised RBF Networks Trained Using an IBL Algorithm for Mining Symbolic Data 587
Author Index 595
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)