close menu
Bookswagon-24x7 online bookstore
close menu
My Account
4%
Proceedings of the 5th International Conference on Data Mining: (119 Proceedings in Applied Mathematics)

Proceedings of the 5th International Conference on Data Mining: (119 Proceedings in Applied Mathematics)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Proceedings in Applied Mathematics 119 Conference held April 2005, Newport Beach, California. The Fifth SIAM International Conference on Data Mining continues the tradition of providing an open forum for the presentation and discussion of innovative algorithms as well as novel applications of data mining.

Table of Contents:
Message from the Program Co-Chairs; Preface; Computational Developments of I-learning; Sijin Liu, Xiaotong Shen, and Wing Hung Wong; A Random Walks Perspective on Maximizing Satisfaction and Profit; Matthew Brand; Surveying Data for Patchy Structure; Ronald Pearson; 2-Dimensional Singular Value Decomposition for 2D Maps and Images; Chris Ding and Jieping Ye; Summarizing and Mining Skewed Data Streams. Graham Cormode and S. Muthukrishnan; Online Analysis of Community Evolution in Data Streams; Charu Aggarwal and Philip Yu; Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window; Chih-Hsiang Lin, Ding-Ying Chiu, Yi-Hung Wu, and Arbee L. P. Chen; On Abnormality Detection in Spuriously Populated Data Streams; Charu Aggarwal; Privacy-Preserving Classification of Customer Data without Loss of Accuracy; Zhiqiang Yang, Sheng Zhong, and Rebecca Wright; Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining; Xintao Wu, Ying Wu, Yongge Wang, and Yingjiu Li; On Variable Constraints in Privacy Preserving Data Mining; Charu Aggarwal and Philip Yu; Clustering with Model-level Constraints; David Gondek, Shivakumar Vaithyanathan, and Ashutosh Garg; Clustering with Constraints: Feasibility Issues and the k-Means Algorithm; Ian Davidson and S. S. Ravi; A Cutting Algorithm for the Minimum Sum-of-Squared Error Clustering; Yu Xia and Jiming Peng; Dynamic Classification of Defect Structures in Molecular Dynamics Simulation Data; Sameep Mehta, Steve Barr, Alex Choy, Hui Yang, Srinivasan; Parthasarathy, Raghu Machiraju, and John Wilkins; Striking Two Birds With One Stone: Simultaneous Mining of Positive and Negative Spatial Patterns; Bavani Arunasalam, Sanjay Chawla, and Pei Sun; Finding Young Stellar Populations in Elliptical Galaxies from Independent Components of Optical Spectra; Ata Kaban, Louisa Nolan, and Somak Raychaudhury; Hybrid Attribute Reduction for Classification Based on a Fuzzy Rough Set Technique; Qinghua Hu, Daren Yu, and Zongxia Xie; HARMONY: Efficiently Mining the Best Rules for Classification; Jianyong Wang and George Karypis; On Error Correlation and Accuracy of Nearest Neighbor Ensemble Classifiers; Carlotta Domeniconi and Bojun Yan; Lazy Learning for Classification Based on Query Projections; Yiqiu Han and Wai Lam; Mining Non-Derivable Association Rules; Bart Goethals, Juho Muhonen, and Hannu Toivonen; Depth-First Non-Derivable Itemset Mining; Toon Calders and Bart Goethals; Exploiting Relationships for Domain-Independent Data Cleaning; Dmitri Kalashnikov, Sharad Mehrotra, and Zhaoqi Chen; A Spectral Clustering Approach To Finding Communities in Graph; Scott White and Padhraic Smyth; Mining Behavior Graphs for "Backtrace" of Noncrashing Bugs; Chao Liu, Xifeng Yan, Hwanjo Yu, Jiawei Han, and Philip Yu; Learning to Refine Ontology for a New Web Site Using a Bayesian Approach; Tak-Lam Wong and Wai Lam; Exploiting Parameter Related Domain Knowledge for Learning in Graphical Models; Radu Stefan Niculescu, Tom Mitchell, and Bharat Rao; Exploiting Geometry for Support Vector Machine Indexing. Navneet Panda and Edward Chang; Parallel Computation of RBF Kernels for Support Vector Classifiers; Shibin Qiu and Terran Lane; Loadstar: A Load Shedding Scheme for Classifying Data Streams; Yun Chi, Philip Yu, Haixun Wang, and Richard Muntz; Topic-driven Clustering for Document Datasets; Ying Zhao and George Karypis; Variational Learning for Noisy-OR Component Analysis; Tomas Singliar and Milos Hauskrecht; Summarizing Sequential Data with Closed Partial Orders; Gemma Casas-Garriga; SUMSRM: A New Statistic for the Structural Break Detection in Time Series; Kwok Pan Pang and Kai Ming Ting; Markov Models for Identification of Significant Episodes; Robert Gwadera, Mikhail Atallah, and Wojciech Szpankowski; Efficient Mining of Maximal Sequential Patterns Using Multiple Samples; Congnan Luo and Soon Chung; Gaussian Processes for Active Data Mining of Spatial Aggregates; Naren Ramakrishnan, Chris Bailey-Kellogg, Satish Tadepalli, and Varun Pandey; Correlation Clustering for Learning Mixtures of Canonical Correlation Models; Xiaoli Fern, Carla Brodley, and Mark Friedl; On Periodicity Detection and Structural Periodic Similarity; Michail Vlachos, Philip Yu, and Vittorio Castelli; Cross Table Cubing: Mining Iceberg Cubes from Data Warehouses; Jian Pei, Moonjung Cho, and David Cheung; Decision Tree Induction in High Dimensional, Hierarchically Distributed Databases; Amir Bar-Or, Ran Wolff, Assaf Schuster, and Daniel Keren; Slope One Predictors for Online Rating-Based Collaborative Filtering; Daniel Lemire and Anna Maclachlan; Sparse Fisher Discriminant Analysis for Computer Aided Detection; Mehmet Dundar, Glenn Fung, Jinbo Bi, Sandilya Sathyakama, and Bharat Rao; Expanding the Training Data Space Using Emerging Patterns and Genetic Methods; Hamad Alhammady and Kotagiri Ramamohanarao; Making Data Mining Models Useful to Model Non-paying Customers of Exchange Carriers; Wei Fan, Janek Mathuria, and Chang-tien Lu; Matrix Condition Number Prediction with SVM Regression and Feature Selection; Shuting Xu and Jun Zhang; Cluster Validity Analysis of Alternative Results from Multi-Objective Optimization; Yimin Liu, Tansel A - zyer, Reda Alhajj, and Ken Barker; ClosedPROWL: Efficient Mining of Closed Frequent Continuities by Projected Window List Technology; Kuo-Yu Huang, Chia-Hui Chang, and Kuo-Zui Lin; Three Myths about Dynamic Time Warping Data Mining; Chotirat Ann Ratanamahatana and Eamonn Keogh. PCA without Eigenvalue Calculations: A Case Study on Face Recognition; Effrosyni Kokiopoulou and Yousef Saad; Mining Top-K Itemsets over a Sliding Window Based on Zipfian Distribution; Raymond Chi-Wing Wong and Ada Wai-Chee Fu; Hierarchical Document Classification Using Automatically Generated Hierarchy; Tao Li and Shenghuo Zhu; On Clustering Binary Data; Tao Li and Shenghuo Zhu; Time-series Bitmaps: a Practical Visualization Tool for Working with Large Time Series Databases; Nitin Kumar, Venkata Nishanth Lolla, Eamonn Keogh, Stefano Lonardi, and Chotirat Ann Ratanamahatana; Pushing Feature Selection Ahead of Join; Rong She, Ke Wang, Yabo Xu, and Philip Yu; Discarding Insignificant Rules during Impact Rule Discovery in Large, Dense Databases; Shiying Huang and Geoffrey Webb; SPID4.7: Discretization Using Successive Pseudo Deletion at Maximum Information Gain Boundary Points; Himika Biswas and Somnath Pal; Iterative Mining for Rules with Constrained Antecedents; Zheng Sun, Philip Yu, and Xiang-Yang Li; Influence in Ratings-Based Recommender Systems: An Algorithm-Independent Approach; Al Rashid, George Karypis, and John Riedl; Mining Unconnected Patterns in Workflows; Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, and Domenico Sacca'; The Best Nurturers in Computer Science Research; Bharath Kumar Mohan and Y. N. Srikant; Knowledge Discovery from Heterogeneous Dynamic Systems using Change-Point Correlations; Tsuyoshi IdA and Keisuke Inoue; Building Decision Trees on Records Linked through Key References; Ke Wang, Yabo Xu, Philip Yu, and Rong She; Efficient Allocation of Marketing Resources using Dynamic Programming; Giuliano Tirenni, Abderrahim Labbi, AndrA Elisseeff, and CAsar Berrospi; Near-Neighbor Search in Pattern Distance Spaces; Haixun Wang, Chang-Shing Perng, and Philip Yu; An Algorithm for Well Structured Subspace Clusters; Haiyun Bian and Raj Bhatnagar; CBS: A New Classification Method by Using Sequential Patterns; Vincent S.-M. Tseng and Chao-Hui Lee. SeqIndex: Indexing Sequences by Sequential Pattern Analysis; Hong Cheng, Xifeng Yan, and Jiawei Han; On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering; Chris Ding, Xiaofeng He, and Horst D. Simon; Kronecker Factorization for Speeding up Kernel Machines; Gang Wu, Zhihua Zhang, and Edward Chang; Symmetric Statistical Translation Models for Automatic Image Annotation; Feng Kang and Rong Jin; Correcting Sampling Bias in Structural Genomics through Iterative Selection of Underrepresented Targets; Kang Peng, Slobodan Vucetic, and Zoran Obradovic; Statictical Models for Unequally Spaced Time Series; Alina Beygelzimer, Emre Erdogan, Sheng Ma, and Irina Rish; CLSI: A Flexible Approximation Scheme from Clustered Term-Document Matrices; Efstratios Gallopoulos and Dimitrios Zeimpekis; WFIM: Weighted Frequent Itemset Mining with a Weight Range and a Minimum Weight; Unil Yun and John Leggett; Model-based Clustering With Probabilistic Constraints; Martin Hiu Chung Law, Alexander Topchy, and Anil K. Jain; Author Index.


Best Seller

| | See All

Product Details
  • ISBN-13: 9780898715934
  • Publisher: Society for Industrial & Applied Mathematics,U.S.
  • Publisher Imprint: Society for Industrial & Applied Mathematics,U.S.
  • Edition: 0005-
  • No of Pages: 648
  • Series Title: 119 Proceedings in Applied Mathematics
  • ISBN-10: 0898715938
  • Publisher Date: 01 Apr 2005
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Weight: 700 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Be The First to Review
Proceedings of the 5th International Conference on Data Mining: (119 Proceedings in Applied Mathematics)
Society for Industrial & Applied Mathematics,U.S. -
Proceedings of the 5th International Conference on Data Mining: (119 Proceedings in Applied Mathematics)
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.

Proceedings of the 5th International Conference on Data Mining: (119 Proceedings in Applied Mathematics)

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

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA