Table of Contents

• A General Framework for Mining Concept-Drifting Data Streams with Skewed DistributionsJing Gao, Wei Fan, Jiawei Han, Philip S. Yu. 3-14 [doi]
• Fast Counting with AV-Space for Efficient Rule InductionLinyan Wang, Aijun An. 15-26 [doi]
• Maximizing the Area under the ROC Curve with Decision Lists and Rule SetsHenrik Boström. 27-34 [doi]
• Maximum Margin Classifiers with Specified False Positive and False Negative Error RatesJ. Saketha Nath, Chiranjib Bhattacharyya. 35-46 [doi]
• AC-Framework for Privacy-Preserving CollaborationWei Jiang, Chris Clifton. 47-56 [doi]
• On Privacy-Preservation of Text and Sparse Binary Data with SketchesCharu C. Aggarwal, Philip S. Yu. 57-67 [doi]
• Preventing Information Leaks in EmailVitor R. Carvalho, William W. Cohen. 68-77 [doi]
• Towards Attack-Resilient Geometric Data PerturbationKeke Chen, Gordon Sun, Ling Liu. 78-89 [doi]
• Adaptive Concept Learning through Clustering and Aggregation of Relational DataHichem Frigui, Cheul Hwang. 90-101 [doi]
• RCMap: Efficiently Creating High-Quality Euclidean EmbeddingsArun Qamra, Edward Y. Chang. 102-112 [doi]
• Active Learning of Constraints for Semi-supervised Text ClusteringRuizhang Huang, Wai Lam, Zhigang Zhang. 113-124 [doi]
• Mining Naturally Smooth Evolution of Clusters from Dynamic DataYi Wang, Shi-Xia Liu, Jianhua Feng, Lizhu Zhou. 125-134 [doi]
• Clustering by weighted cuts in directed graphsMarina Meila, William Pentney. 135-144 [doi]
• Multi-way Clustering on Relation GraphsArindam Banerjee, Sugato Basu, Srujana Merugu. 145-156 [doi]
• Fast Multilevel Transduction on GraphsFei Wang, Changshui Zhang. 157-168 [doi]
• Conical Dimension as an Intrinsic Dimension Estimator and its ApplicationsXin Yang, Sebastien Michea, Hongyuan Zha. 169-179 [doi]
• Nonlinear Dimensionality Reduction using Approximate Nearest NeighborsErion Plaku, Lydia E. Kavraki. 180-191 [doi]
• On Point Sampling Versus Space Sampling for Dimensionality ReductionCharu C. Aggarwal. 192-203 [doi]
• An Analysis of Logistic Models: Exponential Family Connections and Online PerformanceArindam Banerjee. 204-215 [doi]
• Bandits for Taxonomies: A Model-based ApproachSandeep Pandey, Deepak Agarwal, Deepayan Chakrabarti, Vanja Josifovski. 216-227 [doi]
• Boosting Optimal Logical Patterns Using Noisy DataNoam Goldberg, Chung-chieh Shan. 228-236 [doi]
• Constraint-Based Pattern Set MiningLuc De Raedt, Albrecht Zimmermann. 237-248 [doi]
• Finding Motifs in a Database of ShapesXiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra-Neto. 249-260 [doi]
• Incremental Spectral Clustering With Application to Monitoring of Evolving Blog CommunitiesHuazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thomas S. Huang. 261-272 [doi]
• ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data SetsXiaolei Li, Jiawei Han, Sangkyum Kim, Hector Gonzalez. 273-284 [doi]
• Segmentations with RearrangementsAristides Gionis, Evimaria Terzi. 285-296 [doi]
• Efficient Multiclass Boosting Classification with Active LearningJian Huang 0002, Seyda Ertekin, Yang Song, Hongyuan Zha, C. Lee Giles. 297-308 [doi]
• Kernel Based Detection of Mislabeled Training ExamplesHamed Valizadegan, Pang-Ning Tan. 309-319 [doi]
• On Sample Selection Bias and Its Efficient Correction via Model Averaging and Unlabeled ExamplesWei Fan, Ian Davidson. 320-331 [doi]
• Probabilistic Joint Feature Selection for Multi-task LearningTao Xiong, Jinbo Bi, R. Bharat Rao, Vladimir Cherkassky. 332-342 [doi]
• Fast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation ProblemDongmin Kim, Suvrit Sra, Inderjit S. Dhillon. 343-354 [doi]
• Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAMBernard N. Sheehan, Yousef Saad. 355-365 [doi]
• Less is More: Compact Matrix Decomposition for Large Sparse GraphsJimeng Sun, Yinglian Xie, Hui Zhang, Christos Faloutsos. 366-377 [doi]
• Harmonium Models for Semantic Video Representation and ClassificationJun Yang, Yan Liu, Eric P. Xing, Alexander G. Hauptmann. 378-389 [doi]
• Identifying Bundles of Product Options using Mutual Information ClusteringClaudia Perlich, Saharon Rosset. 390-397 [doi]
• Lattice based Clustering of Temporal Gene-Expression MatricesYang Huang, Martin Farach-Colton. 398-409 [doi]
• Robust, Complete, and Efficient Correlation ClusteringElke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek. 413-418 [doi]
• On Anonymization of String DataCharu C. Aggarwal, Philip S. Yu. 419-424 [doi]
• Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk ApproachYijian Bai, Haixun Wang, Carlo Zaniolo. 425-430 [doi]
• Topic Models over Text Streams: A Study of Batch and Online Unsupervised LearningArindam Banerjee, Sugato Basu. 431-436 [doi]
• Are approximation algorithms for consensus clustering worthwhile?Michael Bertolacci, Anthony Wirth. 437-442 [doi]
• Learning from Time-Changing Data with Adaptive WindowingAlbert Bifet, Ricard Gavaldà. 443-448 [doi]
• WAT: Finding Top-K Discords in Time Series DatabaseYingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, Eamonn J. Keogh, Jian Pei, Sam Meshkin. 449-454 [doi]
• A PAC Bound for Approximate Support Vector MachinesDongwei Cao, Daniel Boley. 455-460 [doi]
• Localized Support Vector Machine and Its Efficient AlgorithmHaibin Cheng, Pang-Ning Tan, Rong Jin. 461-466 [doi]
• Understanding and Utilizing the Hierarchy of Abnormal BGP EventsDejing Dou, Jun Li, Han Qin, Shiwoong Kim, Sheng Zhong. 467-472 [doi]
• Distributed Top-K Outlier Detection from Astronomy Catalogs using the DEMAC SystemHaimonti Dutta, Chris Giannella, Kirk D. Borne, Hillol Kargupta. 473-478 [doi]
• Mining Visual and Textual Data for Constructing a Multi-Modal ThesaurusHichem Frigui, Joshua Caudill. 479-484 [doi]
• HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer ClusteringKhaled M. Hammouda, Mohamed S. Kamel. 485-490 [doi]
• Bursty Feature Representation for Clustering Text StreamsQi He, Kuiyu Chang, Ee-Peng Lim, Jun Zhang. 491-496 [doi]
• Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based ApproachBijit Hore, Ravi Chandra Jammalamadaka, Sharad Mehrotra. 497-502 [doi]
• A System for Keyword Search on Textual StreamsVagelis Hristidis, Oscar Valdivia, Michail Vlachos, Philip S. Yu. 503-508 [doi]
• Co-Preserving Patterns in Bipartite Partitioning for Topic IdentificationTianming Hu, Hui Xiong, Sam Yuan Sung. 509-514 [doi]
• Change-Point Detection using Krylov Subspace LearningTsuyoshi Idé, Koji Tsuda. 515-520 [doi]
• Approximating Representations for Large Numerical DatabasesSzymon Jaroszewicz, Marcin Korzen. 521-526 [doi]
• Distance Preserving Dimension Reduction for Manifold LearningHyunsoo Kim, Haesun Park, Hongyuan Zha. 527-532 [doi]
• Stacked Graphical Models for Efficient Inference in Markov Random FieldsZhenzhen Kou, William W. Cohen. 533-538 [doi]
• Summarizing Review Scores of Unequal ReviewersHady Wirawan Lauw, Ee-Peng Lim, Ke Wang. 539-544 [doi]
• A Better Alternative to Piecewise Linear Time Series SegmentationDaniel Lemire. 545-550 [doi]
• Patterns of Cascading Behavior in Large Blog GraphsJure Leskovec, Mary McGlohon, Christos Faloutsos, Natalie S. Glance, Matthew Hurst. 551-556 [doi]
• PoClustering: Lossless Clustering of Dissimilarity DataJinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMillan, Jan Prins. 557-562 [doi]
• An incremental data-stream sketch using sparse random projectionsAditya Krishna Menon, Gia Vinh Anh Pham, Sanjay Chawla, Anastasios Viglas. 563-568 [doi]
• Performance of Recommendation Systems in Dynamic Streaming EnvironmentsOlfa Nasraoui, Jeff Cerwinske, Carlos Rojas, Fabio A. González. 569-574 [doi]
• Scalable Name Disambiguation using Multi-level Graph PartitionByung-Won On, Dongwon Lee. 575-580 [doi]
• Dynamic Algorithm for Graph Clustering Using Minimum Cut TreeBarna Saha, Pabitra Mitra. 581-586 [doi]
• Rank Aggregation for Similar ItemsD. Sculley. 587-592 [doi]
• Sketching Landscapes of Page FarmsBin Zhou 0002, Jian Pei. 593-598 [doi]
• Estimating False Negatives for Classification Problems with Cluster StructureGyörgy J. Simon, Vipin Kumar, Zhi-Li Zhang. 599-604 [doi]
• Discriminating Subsequence Discovery for Sequence ClusteringJianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal. 605-610 [doi]
• Fast Best-Match Shape Searching in Rotation Invariant Metric SpacesDragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng Xi, Wendy L. Hodges. 611-616 [doi]
• HACS: Heuristic Algorithm for Clustering SubsetsDing Yuan, W. Nick Street. 617-622 [doi]
• On Demand Phenotype Ranking through Subspace ClusteringXiang Zhang, Wei Wang 0010, Jun Huan. 623-628 [doi]
• Semi-Supervised Dimensionality ReductionDaoqiang Zhang, Zhi-Hua Zhou, Songcan Chen. 629-634 [doi]
• Computing Statistical Profiles of Active Sites in ProteinsChang Zhao, Jalal Mahmud, I. V. Ramakrishnan, Subramanyam Swaminathan. 635-640 [doi]
• Semi-supervised Feature Selection via Spectral AnalysisZheng Zhao, Huan Liu. 641-646 [doi]