Table of Contents

• Area Under ROC Optimisation using a Ramp ApproximationAlan Herschtal, Bhavani Raskutti, Peter K. Campbell. 1-11 [doi]
• On the Necessary and Sufficient Conditions of a Meaningful Distance Function for High Dimensional Data SpaceChih-Ming Hsu, Ming-Syan Chen. 12-23 [doi]
• CPM: A Covariance-preserving Projection MethodJieping Ye, Tao Xiong, Ravi Janardan. 24-34 [doi]
• Transform Regression and the Kolmogorov Superposition TheoremEdwin P. D. Pednault. 35-46 [doi]
• A Latent Dirichlet Model for Unsupervised Entity ResolutionIndrajit Bhattacharya, Lise Getoor. 47-58 [doi]
• Deriving Private Information from Randomly Perturbed RatingsSheng Zhang, James Ford, Fillia Makedon. 59-69 [doi]
• Name Reference Resolution in Organizational Email ArchivesChristopher P. Diehl, Lise Getoor, Galileo Namata. 70-81 [doi]
• Automated Knowledge Discovery from SimulatorsMichael C. Burl, Dennis DeCoste, Brian L. Enke, Dominic Mazzoni, William J. Merline, Lucas Scharenbroich. 82-93 [doi]
• Mining for Outliers in Sequential DatabasesPei Sun, Sanjay Chawla, Bavani Arunasalam. 94-105 [doi]
• Mining Control Flow Abnormality for Logic Error IsolationChao Liu, Xifeng Yan, Jiawei Han. 106-117 [doi]
• Scan Detection: A Data Mining ApproachGyörgy J. Simon, Hui Xiong, Eric Eilertson, Vipin Kumar. 118-129 [doi]
• Learning Bayesian Networks from Incomplete Data: An Efficient Method for Generating Approximate Predictive DistributionsCarsten Riggelsen. 130-140 [doi]
• Efficient Markov Network Structure Discovery using Independence TestsFacundo Bromberg, Dimitris Margaritis, Vasant Honavar. 141-152 [doi]
• K-Means Clustering Over a Large, Dynamic NetworkSouptik Datta, Chris Giannella, Hillol Kargupta. 153-164 [doi]
• Adapting K-Medians to Generate Normalized Cluster CentersBenjamin J. Anderson, Deborah S. Gross, David R. Musicant, Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg. 165-175 [doi]
• Advanced Prototype Machines: Exploring Prototypes for ClassificationHans-Peter Kriegel, Matthias Schubert. 176-187 [doi]
• Toward Semantic XML ClusteringAndrea Tagarelli, Sergio Greco. 188-199 [doi]
• A Semantic Approach for Mining Hidden Links from Complementary and Non-interactive Biomedical LiteratureXiaohua Hu, Xiaodan Zhang, Illhoi Yoo, Yanqing Zhang. 200-209 [doi]
• Representation is Everything: Towards Efficient and Adaptable Similarity Measures for Biological DataCharu C. Aggarwal. 210-221 [doi]
• Mining Frequent Agreement Subtrees in Phylogenetic DatabasesSen Zhang, Jason Tsong-Li Wang. 222-233 [doi]
• Trend Relational Analysis and Grey-Fuzzy Clustering MethodZhijie Chen, Weizhen Chen, Qile Chen, Mian-Yun Chen. 234-245 [doi]
• Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center ProblemMartin Ester, Rong Ge, Byron J. Gao, Zengjian Hu, Boaz Ben-Moshe. 246-257 [doi]
• Weighted Clustering EnsemblesMuna Al-Razgan, Carlotta Domeniconi. 258-269 [doi]
• Clustering in the Presence of Bridge-NodesJerry Scripps, Pang-Ning Tan. 270-281 [doi]
• Mining Interesting Patterns from Very High Dimensional Data: A Top-Down Row Enumeration ApproachHongyan Liu, Jiawei Han, Dong Xin, Zheng Shao. 282-293 [doi]
• Mining Frequent Patterns by Differential Refinement of Clustered BitmapsJianwei Li, Alok N. Choudhary, Nan Jiang, Wei-keng Liao. 294-305 [doi]
• Discovery of Co-evoluting Spatial Co-located Event SetsJin Soung Yoo, Shashi Shekhar, Sangho Kim, Mete Celik. 306-315 [doi]
• Efficient Algorithms for Sequence SegmentationEvimaria Terzi, Panayiotis Tsaparas. 316-327 [doi]
• Density-Based Clustering over an Evolving Data Stream with NoiseFeng Cao, Martin Ester, Weining Qian, Aoying Zhou. 328-339 [doi]
• A Random Walks Method for Text ClassificationYunpeng Xu, Xing Yi, Changshui Zhang. 340-347 [doi]
• Efficient Mining of Temporally Annotated SequencesFosca Giannotti, Mirco Nanni, Dino Pedreschi. 348-359 [doi]
• A Framework for Local Supervised Dimensionality Reduction of High Dimensional DataCharu C. Aggarwal. 360-371 [doi]
• Segmentation and dimensionality reductionElla Bingham, Aristides Gionis, Niina Haiminen, Heli Hiisilä, Heikki Mannila, Evimaria Terzi. 372-383 [doi]
• Probabilistic Multi-State Split-Merge Algorithm for Coupling Parameter EstimatesJuan K. Lin. 384-394 [doi]
• Item Sets that CompressArno Siebes, Jilles Vreeken, Matthijs van Leeuwen. 395-406 [doi]
• Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and AnalysisJinze Liu, Susan Paulsen, Xing Sun, Wei Wang 0010, Andrew B. Nobel, Jan Prins. 407-418 [doi]
• Mining frequent closed itemsets out-of-coreClaudio Lucchese, Salvatore Orlando, Raffaele Perego. 419-429 [doi]
• Local L2-Thresholding Based Data Mining in Peer-to-Peer SystemsRan Wolff, Kanishka Bhaduri, Hillol Kargupta. 430-441 [doi]
• Collaborative Information Extraction and Mining from Multiple Web DocumentsTak-Lam Wong, Wai Lam, Shing-Kit Chan. 442-452 [doi]
• Collaborative Document ClusteringKhaled M. Hammouda, Mohamed S. Kamel. 453-463 [doi]
• Cluster Description Formats, Problems and AlgorithmsByron J. Gao, Martin Ester. 464-468 [doi]
• Positive Borders or Negative Borders: How to Make Lossless Generator Based Representations ConciseGuimei Liu, Jinyan Li, Limsoon Wong, Wynne Hsu. 469-473 [doi]
• Bayesian K-Means as a Maximization-Expectation AlgorithmMax Welling, Kenichi Kurihara. 474-478 [doi]
• A Framework for Clustering Massive Text and Categorical Data StreamsCharu C. Aggarwal, Philip S. Yu. 479-483 [doi]
• Cone Cluster Labeling for Support Vector ClusteringSei-Hyung Lee, Karen M. Daniels. 484-488 [doi]
• Semi-Supervised Clustering with Partial Background InformationJing Gao, Pang-Ning Tan, Haibin Cheng. 489-493 [doi]
• A New Privacy-Preserving Distributed k-Clustering AlgorithmGeetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright. 494-498 [doi]
• ODAC: Hierarchical Clustering of Time Series Data StreamsPedro Pereira Rodrigues, João Gama, João Pedro Pedroso. 499-503 [doi]
• Detecting the Change of Clustering Structure in Categorical Data StreamsKeke Chen, Ling Liu. 504-508 [doi]
• Dissimilarity Measures for Detecting Hepatotoxicity in Clinical Trial DataMatthew Eric Otey, Srinivasan Parthasarathy, Donald C. Trost. 509-513 [doi]
• Transductive De-Noising and Dimensionality Reduction using Total Bregman RegressionSreangsu Acharyya. 514-518 [doi]
• Robust Estimation for Mixture of Probability Tables based on beta-likelihoodYu Fujimoto, Noboru Murata. 519-523 [doi]
• Fast optimal bandwidth selection for kernel density estimationVikas C. Raykar, Ramani Duraiswami. 524-528 [doi]
• Risk-Sensitive Learning via Expected Shortfall MinimizationHisashi Kashima. 529-533 [doi]
• On Approximate Solutions to Support Vector MachinesDongwei Cao, Daniel Boley. 534-538 [doi]
• Confidence Estimation Methods for Partially Supervised Information ExtractionEugene Agichtein. 539-543 [doi]
• Inference of Node Replacement Recursive Graph GrammarsJacek P. Kukluk, Lawrence B. Holder, Diane J. Cook. 544-548 [doi]
• Learning from Incomplete Ratings Using Non-negative Matrix FactorizationSheng Zhang, Weihong Wang, James Ford, Fillia Makedon. 549-553 [doi]
• Health monitoring of a shaft transmission system via hybrid models of PCR and PLSYi Fang 0003, Hyun-Woo Cho, Myong Kee Jeong. 554-558 [doi]
• Modeling Evolutionary Behaviors for Community-based Dynamic RecommendationXiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming-Ting Sun. 559-563 [doi]
• A Systematic Cross-Comparison of Sequence ClassifiersBinyamin Rosenfeld, Ronen Feldman, Moshe Fresko. 564-568 [doi]
• Data-Enhanced Predictive Modeling for Sales TargetingSaharon Rosset, Richard D. Lawrence. 569-573 [doi]
• Graph-based Methods for Orbit ClassificationAbraham Bagherjeiran, Chandrika Kamath. 574-578 [doi]
• Mining and Validating Localized Frequent Itemsets with Dynamic ToleranceOlfa Nasraoui, Suchandra Goswami. 579-583 [doi]
• Profiling Protein Families from Partially Aligned SequencesSaikat Mukherjee, Chang Zhao, I. V. Ramakrishnan. 584-588 [doi]
• Personalized Knowledge Discovery: Mining Novel Association Rules from TextXin Chen, Yi-Fang Wu. 589-593 [doi]
• A Novel Framework for Incorporating Labeled Examples into Anomaly DetectionJing Gao, Haibin Cheng, Pang-Ning Tan. 594-598 [doi]
• Towards the Prediction of Protein Abundance from Tandem Mass Spectrometry DataAnthony J. Bonner, Han Liu. 599-603 [doi]
• Using Compression to Identify Classes of Inauthentic TextsMehmet M. Dalkilic, Wyatt T. Clark, James C. Costello, Predrag Radivojac. 604-608 [doi]
• Fast Mining of Distance-Based Outliers in High Dimensional DatasetsAmol Ghoting, Srinivasan Parthasarathy, Matthew Eric Otey. 609-613 [doi]
• Spatial Weighted Outlier DetectionYufeng Kou, Chang-Tien Lu, Dechang Chen. 614-618 [doi]
• Robust Clustering for Tracking Noisy Evolving Data StreamsOlfa Nasraoui, Carlos Rojas. 619-623 [doi]
• WIP: mining Weighted Interesting Patterns with a strong weight and/or support affinityUnil Yun, John J. Leggett. 624-628 [doi]
• Discovering Frequent Tree Patterns over Data StreamsMark Cheng-Enn Hsieh, Yi-Hung Wu, Arbee L. P. Chen. 629-633 [doi]
• Finding Sequential Patterns from a Massive Number of Spatio-Temporal EventsYan Huang, Liqin Zhang, Pusheng Zhang. 634-638 [doi]
• Mining Minimal Contrast Subgraph PatternsRoger Ming Hieng Ting, James Bailey. 639-643 [doi]