Proceedings of the 5th International Conference on Data Mining

Author:   Hillol Kargupta (University of Maryland, Baltimore) ,  Jaideep Srivastava (University of Minnesota) ,  Chandrika Kamath (Lawrence Livermore National Laboratory, California) ,  Arnold Goodman (University of California, Irvine)
Publisher:   Society for Industrial & Applied Mathematics,U.S.
Edition:   5th ed.
Volume:   119
ISBN:  

9780898715934


Pages:   662
Publication Date:   01 April 2005
Format:   Paperback
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $396.00 Quantity:  
Add to Cart

Share |

Proceedings of the 5th International Conference on Data Mining


Add your own review!

Overview

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.

Full Product Details

Author:   Hillol Kargupta (University of Maryland, Baltimore) ,  Jaideep Srivastava (University of Minnesota) ,  Chandrika Kamath (Lawrence Livermore National Laboratory, California) ,  Arnold Goodman (University of California, Irvine)
Publisher:   Society for Industrial & Applied Mathematics,U.S.
Imprint:   Society for Industrial & Applied Mathematics,U.S.
Edition:   5th ed.
Volume:   119
ISBN:  

9780898715934


ISBN 10:   0898715938
Pages:   662
Publication Date:   01 April 2005
Audience:   College/higher education ,  Tertiary & Higher Education
Format:   Paperback
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

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."

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List