
2009 / 1244 pages / CD / ISBN: 9780898716825 / List Price $185.50 /SIAM Member Price $129.85 / Order Code PR133
Symposium held in Sparks, NV, April 30May 2, 2009.
Contents
GAD: General Activity Detection for Fast Clustering on Large Data; CORE: Nonparametric Clustering of Large Numeric Databases; ConstraintBased Subspace Clustering; Integrated KL (Kmeans – Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations; Hybrid Clustering of Text Mining and Bibliometrics Applied to Journal Sets; Event Discovery in Time Series; FuncICA for Time Series Pattern Discovery; Autocannibalistic and Anyspace Indexing Algorithms with Application to Sensor Data Mining; ProximityBased Anomaly Detection Using Sparse Structure Learning; Optimal Distance Bounds on TimeSeries Data; Application of Bayesian Partition Models in Warranty Data Analysis; Learning RandomWalk Kernels for Protein Remote Homology Identification and Motif Discovery; Outlier Detection with Globally Optimal ExemplarBased GMM; PriorFree Rare Category Detection; A Family of Large Margin Linear Classifiers and Its Application in Dynamic Environments; Unsupervised Learning and Clustering; DensEst: Density Estimation for Data Mining in High Dimensional Spaces; A Framework for Exploring Categorical Data; Discovering Substantial Distinctions among Incremental; Agglomerative MeanShift Clustering via Query Set Compression; Adaptive Concept Drift Detection; Scalable Distributed Change Detection from Astronomy Data Streams Using Local, Asynchronous Eigen Monitoring Algorithms; Positive Unlabeled Learning for Data Stream Classification; TimeDecayed Correlated Aggregates over Data Streams; MultiModal Hierarchical Dirichlet Process Model for Predicting Image Annotation and ImageObject Label Correspondence; A Bayesian Approach to Graphy Regression with Relevant Subgraph Selection; A Hybrid Data Mining Metaheuristic for the pMedian Problem; A New Constraint for Mining Sets in Sequences; A Reevaluation of the OverSearching Phenomenon in Inductive Rule Learning; A SemiSupervised Framework for Feature Mapping and Multiclass Classification; Aligned Graph Classification with Regularized Logistic Regression; An Entity Based Model for Coreference Resolution; Analyses for Service Interaction Networks with Applications to Service Delivery; ChangePoint Detection in TimeSeries Data by Direct DensityRatio Estimation; Context Aware Trace Clustering: Towards Improving Process Mining Results; Detection and Characterization of Anomalies in Multivariate Time Series; Discovery of Geospatial Discriminating Patterns from Remote Sensing Datasets; DiversityBased Weighting Schemes for Clustering Ensembles; Divide and Conquer Strategies for Effective Information Retrieval; Speeding Up Secure Computations via Embedded Caching; Exact Discovery of Time Series Motifs; Exploiting Semantic Constraints for Estimating Supersenses with CRFs; Feature Weighted SVMs Using Receiver Operating Characteristics; FEDRA: A Fast and Efficient Dimensionality Reduction Algorithm; Finding Representative Association Rules from Large Rule Collections; FutureRank: Ranking Scientific Articles by Predicting their Future PageRank; Highlighting Diverse Concepts in Documents; Identifying InformationRich Subspace Trends in HighDimensional Data; LowEntropy Set Selection; Measuring Discrimination in SociallySensitive Decision Records; Mining Cohesive Patterns from Graphs with Feature Vectors; Mining Complex SpatioTemporal Sequence Patterns; Mining for Surprise Events Within Text Streams; Multifield Correlated Topic Modeling; Multiple Kernel Clustering; MUSK: Uniform Sampling of k Maximal Patterns; Noise Robust Classification Based on Spread Spectrum; Nonnegative Matrix Factorization, Convexity and Isometry; Nonparametric InformationTheoretic Measures of OneDimensional Distribution Functions from Continuous Time Series; On Maximum Coverage in the Streaming Model & Application to Multitopic BlogWatch; On Randomness Measures for Social Networks; On SegmentBased Stream Modeling and Its Applications; On the Comparison of Relative Clustering Validity Criteria; Parallel Pairwise Clustering; PICC Counting: Who Needs Joins When You Can Propagate Efficiently?; Providing Privacy through Plausibly Deniable Search; Randomization Techniques for Graphs; Semisupervised Learning by Sparse Representation; ShatterPlots: Fast Tools for Mining Large Graphs; Spatially CostSensitive Active Learning; Structure and Dynamics of Research Collaboration in Computer Science; Text Categorization with All Substring Features; The Set Classification Problem and Solution Methods; Topic Evolution in a Stream of Documents; Tracking User Mobility to Detect Suspicious Behavior; Toward Optimal Ordering of Prediction Tasks; Hierarchical Linear Discriminant Analysis for Beamforming; Twin Vector Machines for Online Learning on a Budget; The Metric Dilemma: CompetenceConscious Associative Classification; AMORI: A MetricBased One Rule Inducer; Identifying Unsafe Routes for NetworkBased Trajectory Privacy; Privacy Preservation in Social Networks with Sensitive Edge Weights; Graph Generation with Prescribed Feature Constraints; Detecting Communities in Social Networks Using MaxMin Modularity; A Bayesian Approach Toward Finding Communities and Their Evolutions in Dynamic Social Networks; Efficient Discovery of Interesting Patterns Based on Strong Closedness; Efficient Computation of PartialSupport for Mining Interesting Itemsets; Grammar Mining; Topk Correlative Graph Mining; High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic; MultiVis: ContentBased Social Network Exploration through Multiway Visual Analysis; NearOptimal Supervised Feature Selection among Frequent Subgraphs; PolynomialDelay and PolynomialSpace Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems; Link Propagation: A Fast Semisupervised Learning Algorithm for Link Prediction; Understanding Importance of Collaborations in Coauthorship Networks: A Supportiveness Analysis Approach; Topic Cube: Topic Modeling for OLAP on Multidimensional Text Databases; Local Relevance Weighted Maximum Margin Criterion for Text Classification; Multitopic Based QueryOriented Summarization; Straightforward Feature Selection for Scalable Latent Semantic Indexing; Parallel Large Scale Feature Selection for Logistic Regression; TravelTime Prediction Using Gaussian Process Regression: A TrajectoryBased Approach; Discretized SpatioTemporal Scan Window; Finding Links and Initiators: A GraphReconstruction Problem; Efficient Multiplicative Updates for Support Vector Machines; Efficient Active Learning with Boosting; Author Index.
ISBN: 9780898716825