Advances in Knowledge Discovery and Data Mining
Home > Computing and Information Technology > Databases > Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)
Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)

Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




International Edition


About the Book

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.

Table of Contents:
Keynote Presentations.- Incompleteness in Data Mining.- Mining E-Commerce Data: The Good, the Bad, and the Ugly.- Seamless Integration of Data Mining with DBMS and Applications.- Web Mining.- Applying Pattern Mining to Web Information Extraction.- Empirical Study of Recommender Systems Using Linear Classifiers.- iJADE eMiner - A Web-Based Mining Agent Based on Intelligent Java Agent Development Environment (iJADE) on Internet Shopping.- A Characterized Rating Recommend System.- Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents.- Text Mining.- Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification.- Predictive Self-Organizing Networks for Text Categorization.- Meta-learning Models for Automatic Textual Document Categorization.- Efficient Algorithms for Concept Space Construction.- Topic Detection, Tracking, and Trend Analysis Using Self-Organizing Neural Networks.- Automatic Hypertext Construction through a Text Mining Approach by Self-Organizing Maps.- Applications and Tools.- Semantic Expectation-Based Causation Knowledge Extraction: A Study on Hong Kong Stock Movement Analysis.- A Toolbox Approach to Flexible and Efficient Data Mining.- Determining Progression in Glaucoma Using Visual Fields.- Seabreeze Prediction Using Bayesian Networks.- Semi-supervised Learning in Medical Image Database.- On Application of Rough Data Mining Methods to Automatic Construction of Student Models.- Concept Hierarchies.- Concept Approximation in Concept Lattice.- Generating Concept Hierarchies/Networks: Mining Additional Semantics in Relational Data.- Representing Large Concept Hierarchies Using Lattice Data Structure.- Feature Selection.- Feature Selection for Temporal Health Records.- Boosting the Performance of Nearest Neighbour Methods with Feature Selection.- Feature Selection for Meta-learning.- Interestingness.- Efficient Mining of Niches and Set Routines.- Evaluation of Interestingness Measures for Ranking Discovered Knowledge.- Peculiarity Oriented Mining and Its Application for Knowledge Discovery in Amino-Acid Data.- Sequence Mining.- Mining Sequence Patterns from Wind Tunnel Experimental Data for Flight Control.- Scalable Hierarchical Clustering Method for Sequences of Categorical Values.- FFS - An I/O-Efficient Algorithm for Mining Frequent Sequences.- Sequential Index Structure for Content-Based Retrieval.- Spatial and Temporal Mining.- The S 2-Tree: An Index Structure for Subsequence Matching of Spatial Objects.- Temporal Data Mining Using Hidden Markov-Local Polynomial Models.- Patterns Discovery Based on Time-Series Decomposition.- Criteria on Proximity Graphs for Boundary Extraction and Spatial Clustering.- Micro Similarity Queries in Time Series Database.- Association Mining.- Mining Optimal Class Association Rule Set.- Generating Frequent Patterns with the Frequent Pattern List.- User-Defined Association Mining.- Direct and Incremental Computing of Maximal Covering Rules.- Towards Efficient Data Re-mining (DRM).- Data Allocation Algorithm for Parallel Association Rule Discovery.- Classification and Rule Induction.- Direct Domain Knowledge Inclusion in the PA3 Rule Induction Algorithm.- Hierarchical Classification of Documents with Error Control.- An Efficient Data Compression Approach to the Classification Task.- Combining the Strength of Pattern Frequency and Distance for Classification.- A Scalable Algorithm for Rule Post-pruning of Large Decision Trees.- Optimizing the Induction of Alternating Decision Trees.- Building Behaviour Knowledge Space to Make Classification Decision.- Clustering.- Efficient Hierarchical Clustering Algorithms Using Partially Overlapping Partitions.- A Rough Set-Based Clustering Method with Modification of Equivalence Relations.- Importance of Individual Variables in the k-Means Algorithm.- A Hybrid Approach to Clustering in Very Large Databases.- Advanced Topics and New Methods.- A Similarity Indexing Method for the Data Warehousing - Bit-Wise Indexing Method.- Rule Reduction over Numerical Attributes in Decision Trees Using Multilayer Perceptron.- Knowledge Acquisition from Both Human Expert and Data.- Neighborhood Dependencies for Prediction.- Learning Bayesian Networks with Hidden Variables Using the Combination of EM and Evolutionary Algorithms.- Interactive Construction of Decision Trees.- An Improved Learning Algorithm for Augmented Naive Bayes.- Generalised RBF Networks Trained Using an IBL Algorithm for Mining Symbolic Data.


Best Sellers


Product Details
  • ISBN-13: 9783540419105
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 599
  • Returnable: Y
  • Series Title: 2035 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 3540419101
  • Publisher Date: 04 Apr 2001
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2035 Lecture Notes in Computer Science
  • Sub Title: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advances in Knowledge Discovery and Data Mining: 5th Pacific-Asia Conference, PAKDD 2001 Hong Kong, China, April 16-18, 2001. Proceedings(2035 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!