Table of Contents

• Data mining in the online services industryQi Lu. 1-2 [doi]
• Evaluating online ad campaigns in a pipeline: causal models at scaleDavid Chan, Rong Ge, Ori Gershony, Tim Hesterberg, Diane Lambert. 7-16 [doi]
• Overlapping experiment infrastructure: more, better, faster experimentationDiane Tang, Ashish Agarwal, Deirdre O Brien, Mike Meyer. 17-26 [doi]
• Exploitation and exploration in a performance based contextual advertising systemWei Li 0010, Xuerui Wang, Ruofei Zhang, Ying Cui, Jianchang Mao, Rong Jin. 27-36 [doi]
• MineFleet®: an overview of a widely adopted distributed vehicle performance data mining systemHillol Kargupta, Kakali Sarkar, Michael Gilligan. 37-46 [doi]
• Multiple kernel learning for heterogeneous anomaly detection: algorithm and aviation safety case studySantanu Das, Bryan L. Matthews, Ashok N. Srivastava, Nikunj C. Oza. 47-56 [doi]
• Discovery of significant emerging trendsSaurabh Goorha, Lyle Ungar. 57-64 [doi]
• Data mining to predict and prevent errors in health insurance claims processingMohit Kumar, Rayid Ghani, Zhu-Song Mei. 65-74 [doi]
• Optimizing debt collections using constrained reinforcement learningNaoki Abe, Prem Melville, Cezar Pendus, Chandan K. Reddy, David L. Jensen, Vince P. Thomas, James J. Bennett, Gary F. Anderson, Brent R. Cooley, Melissa Kowalczyk, Mark Domick, Timothy Gardinier. 75-84 [doi]
• Detecting abnormal coupled sequences and sequence changes in group-based manipulative trading behaviorsLongbing Cao, Yuming Ou, Philip S. Yu, Gang Wei. 85-94 [doi]
• Automatic malware categorization using cluster ensembleYanfang Ye, Tao Li, Yong Chen, Qingshan Jiang. 95-104 [doi]
• Beyond heuristics: learning to classify vulnerabilities and predict exploitsMehran Bozorgi, Lawrence K. Saul, Stefan Savage, Geoffrey M. Voelker. 105-114 [doi]
• Diagnosing memory leaks using graph mining on heap dumpsEvan K. Maxwell, Godmar Back, Naren Ramakrishnan. 115-124 [doi]
• Using data mining techniques to address critical information exchange needs in disaster affected public-private networksLi Zheng, Chao Shen, Liang Tang, Tao Li, Steven Luis, Shu-Ching Chen, Vagelis Hristidis. 125-134 [doi]
• Tropical cyclone event sequence similarity search via dimensionality reduction and metric learningShen-Shyang Ho, Wenqing Tang, W. Timothy Liu. 135-144 [doi]
• Malstone: towards a benchmark for analytics on large data cloudsCollin Bennett, Robert L. Grossman, David Locke, Jonathan Seidman, Steve Vejcik. 145-152 [doi]
• TIARA: a visual exploratory text analytic systemFuru Wei, Shixia Liu, Yangqiu Song, Shimei Pan, Michelle X. Zhou, Weihong Qian, Lei Shi, Li Tan, Qiang Zhang. 153-162 [doi]
• Metric forensics: a multi-level approach for mining volatile graphsKeith Henderson, Tina Eliassi-Rad, Christos Faloutsos, Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash, Hanghang Tong. 163-172 [doi]
• Active learning for biomedical citation screeningByron C. Wallace, Kevin Small, Carla E. Brodley, Thomas A. Trikalinos. 173-182 [doi]
• An integrated machine learning approach to stroke predictionAditya Khosla, Yu Cao, Cliff Chiung-Yu Lin, Hsu-Kuang Chiu, Junling Hu, Honglak Lee. 183-192 [doi]
• Medical coding classification by leveraging inter-code relationshipsYan Yan, Glenn Fung, Jennifer G. Dy, Rómer Rosales. 193-202 [doi]
• Mining advisor-advisee relationships from research publication networksChi Wang, Jiawei Han, Yuntao Jia, Jie Tang, Duo Zhang, Yintao Yu, Jingyi Guo. 203-212 [doi]
• Estimating rates of rare events with multiple hierarchies through scalable log-linear modelsDeepak Agarwal, Rahul Agrawal, Rajiv Khanna, Nagaraj Kota. 213-222 [doi]
• User browsing models: relevance versus examinationRamakrishnan Srikant, Sugato Basu, Ni Wang, Daryl Pregibon. 223-232 [doi]
• Suggesting friends using the implicit social graphMaayan Roth, Assaf Ben-David, David Deutscher, Guy Flysher, Ilan Horn, Ari Leichtberg, Naty Leiser, Yossi Matias, Ron Merom. 233-242 [doi]
• New perspectives and methods in link predictionRyan Lichtenwalter, Jake T. Lussier, Nitesh V. Chawla. 243-252 [doi]
• UP-Growth: an efficient algorithm for high utility itemset miningVincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu. 253-262 [doi]
• Frequent regular itemset miningSalvatore Ruggieri. 263-272 [doi]
• Mining uncertain data with probabilistic guaranteesLiwen Sun, Reynold Cheng, David W. Cheung, Jiefeng Cheng. 273-282 [doi]
• Mining top-k frequent items in a data stream with flexible sliding windowsHoang Thanh Lam, Toon Calders. 283-292 [doi]
• Probably the best itemsetsNikolaj Tatti. 293-302 [doi]
• Grafting-light: fast, incremental feature selection and structure learning of Markov random fieldsJun Zhu, Ni Lao, Eric P. Xing. 303-312 [doi]
• A scalable two-stage approach for a class of dimensionality reduction techniquesLiang Sun, Betul Ceran, Jieping Ye. 313-322 [doi]
• An efficient algorithm for a class of fused lasso problemsJun Liu, Lei Yuan, Jieping Ye. 323-332 [doi]
• Unsupervised feature selection for multi-cluster dataDeng Cai, Chiyuan Zhang, Xiaofei He. 333-342 [doi]
• Feature selection for support vector regression using probabilistic predictionJian-Bo Yang, Chong Jin Ong. 343-352 [doi]
• Versatile publishing for privacy preservationXin Jin, Mingyang Zhang, Nan Zhang 0004, Gautam Das. 353-362 [doi]
• Privacy-preserving outsourcing support vector machines with random transformationKeng-Pei Lin, Ming-Syan Chen. 363-372 [doi]
• On the quality of inferring interests from social neighborsZhen Wen, Ching-Yung Lin. 373-382 [doi]
• DUST: a generalized notion of similarity between uncertain time seriesSmruti R. Sarangi, Karin Murthy. 383-392 [doi]
• Cold start link predictionVincent Leroy, Berkant Barla Cambazoglu, Francesco Bonchi. 393-402 [doi]
• Learning with cost intervalsXu-Ying Liu, Zhi-Hua Zhou. 403-412 [doi]
• The new iris data: modular data generatorsIris Adä, Michael R. Berthold. 413-422 [doi]
• Why label when you can search?: alternatives to active learning for applying human resources to build classification models under extreme class imbalanceJosh Attenberg, Foster J. Provost. 423-432 [doi]
• Discovering significant relaxed order-preserving submatricesQiong Fang, Wilfred Ng, Jianlin Feng. 433-442 [doi]
• Topic dynamics: an alternative model of bursts in streams of topicsDan He, D. Stott Parker. 443-452 [doi]
• Extracting temporal signatures for comprehending systems biology modelsNaren Sundaravaradan, K. S. M. Tozammel Hossain, Vandana Sreedharan, Douglas J. Slotta, John Paul C. Vergara, Lenwood S. Heath, Naren Ramakrishnan. 453-462 [doi]
• Negative correlations in collaboration: concepts and algorithmsJinyan Li, Qian Liu, Tao Zeng. 463-472 [doi]
• k-Support anonymity based on pseudo taxonomy for outsourcing of frequent itemset miningChih-Hua Tai, Philip S. Yu, Ming-Syan Chen. 473-482 [doi]
• Collusion-resistant privacy-preserving data miningBin Yang, Hiroshi Nakagawa, Issei Sato, Jun Sakuma. 483-492 [doi]
• Data mining with differential privacyArik Friedman, Assaf Schuster. 493-502 [doi]
• Discovering frequent patterns in sensitive dataRaghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhradeep Thakurta. 503-512 [doi]
• Fast nearest-neighbor search in disk-resident graphsPurnamrita Sarkar, Andrew W. Moore. 513-522 [doi]
• Balanced allocation with succinct representationSaeed Alaei, Ravi Kumar, Azarakhsh Malekian, Erik Vee. 523-532 [doi]
• Neighbor query friendly compression of social networksHossein Maserrat, Jian Pei. 533-542 [doi]
• Parallel SimRank computation on large graphs with iterative aggregationGuoming He, Haijun Feng, Cuiping Li, Hong Chen. 543-552 [doi]
• Dynamics of conversationsRavi Kumar, Mohammad Mahdian, Mary McGlohon. 553-562 [doi]
• Flexible constrained spectral clusteringXiang Wang, Ian Davidson. 563-572 [doi]
• A hierarchical information theoretic technique for the discovery of non linear alternative clusteringsXuan Hong Dang, James Bailey. 573-582 [doi]
• Clustering by synchronizationChristian Böhm, Claudia Plant, Junming Shao, Qinli Yang. 583-592 [doi]
• Unifying dependent clustering and disparate clustering for non-homogeneous dataM. Shahriar Hossain, Satish Tadepalli, Layne T. Watson, Ian Davidson, Richard F. Helm, Naren Ramakrishnan. 593-602 [doi]
• Fast euclidean minimum spanning tree: algorithm, analysis, and applicationsWilliam B. March, Parikshit Ram, Alexander G. Gray. 603-612 [doi]
• Mining program workflow from interleaved tracesJian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, Bin Wu. 613-622 [doi]
• Connecting the dots between news articlesDafna Shahaf, Carlos Guestrin. 623-632 [doi]
• Discovering frequent subgraphs over uncertain graph databases under probabilistic semanticsZhaonian Zou, Hong Gao, Jianzhong Li. 633-642 [doi]
• Boosting with structure information in the functional space: an application to graph classificationHongliang Fei, Jun Huan. 643-652 [doi]
• Discriminative topic modeling based on manifold learningSeungil Huh, Stephen E. Fienberg. 653-662 [doi]
• Online multiscale dynamic topic modelsTomoharu Iwata, Takeshi Yamada, Yasushi Sakurai, Naonori Ueda. 663-672 [doi]
• Topic models with power-law using Pitman-Yor processIssei Sato, Hiroshi Nakagawa. 673-682 [doi]
• The topic-perspective model for social tagging systemsCaimei Lu, Xiaohua Hu, Xin Chen, Jung-ran Park, Tingting He, Zhoujun Li. 683-692 [doi]
• Combining predictions for accurate recommender systemsMichael Jahrer, Andreas Töscher, Robert A. Legenstein. 693-702 [doi]
• Fast online learning through offline initialization for time-sensitive recommendationDeepak Agarwal, Bee-Chung Chen, Pradheep Elango. 703-712 [doi]
• Training and testing of recommender systems on data missing not at randomHarald Steck. 713-722 [doi]
• Temporal recommendation on graphs via long- and short-term preference fusionLiang Xiang, Quan Yuan, Shiwan Zhao, Li Chen, Xiatian Zhang, Qing Yang, Jimeng Sun. 723-732 [doi]
• Generative models for ticket resolution in expert networksGengxin Miao, Louise E. Moser, Xifeng Yan, Shu Tao, Yi Chen, Nikos Anerousis. 733-742 [doi]
• Learning to combine discriminative classifiers: confidence basedChi-Hoon Lee. 743-752 [doi]
• Mining positive and negative patterns for relevance feature discoveryYuefeng Li, Abdulmohsen Algarni, Ning Zhong. 753-762 [doi]
• Document clustering via dirichlet process mixture model with feature selectionGuan Yu, Ruizhang Huang, Zhaojun Wang. 763-772 [doi]
• Semantic relation extraction with kernels over typed dependency treesFrank Reichartz, Hannes Korte, Gerhard Paass. 773-782 [doi]
• Latent aspect rating analysis on review text data: a rating regression approachHongning Wang, Yue Lu, ChengXiang Zhai. 783-792 [doi]
• Semi-supervised feature selection for graph classificationXiangnan Kong, Philip S. Yu. 793-802 [doi]
• Modeling relational events via latent classesChristopher DuBois, Padhraic Smyth. 803-812 [doi]
• On community outliers and their efficient detection in information networksJing Gao, Feng Liang, Wei Fan, Chi Wang, Yizhou Sun, Jiawei Han. 813-822 [doi]
• Redefining class definitions using constraint-based clustering: an application to remote sensing of the earth s surfaceDan Preston, Carla E. Brodley, Roni Khardon, Damien Sulla-Menashe, Mark A. Friedl. 823-832 [doi]
• Large linear classification when data cannot fit in memoryHsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin. 833-842 [doi]
• Class-specific error bounds for ensemble classifiersRyan J. Prenger, Tracy D. Lemmond, Kush R. Varshney, Barry Y. Chen, William G. Hanley. 843-852 [doi]
• Designing efficient cascaded classifiers: tradeoff between accuracy and costVikas C. Raykar, Balaji Krishnapuram, Shipeng Yu. 853-860 [doi]
• Direct mining of discriminative patterns for classifying uncertain dataChuancong Gao, Jianyong Wang. 861-870 [doi]
• Ensemble pruning via individual contribution orderingZhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard. 871-880 [doi]
• Fast query execution for retrieval models based on path-constrained random walksNi Lao, William W. Cohen. 881-888 [doi]
• Trust network inference for online rating data using generative modelsFreddy Chong Tat Chua, Ee-Peng Lim. 889-898 [doi]
• An energy-efficient mobile recommender systemYong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao, Marco Gruteser, Michael J. Pazzani. 899-908 [doi]
• Mixture models for learning low-dimensional roles in high-dimensional dataManas Somaiya, Christopher M. Jermaine, Sanjay Ranka. 909-918 [doi]
• Towards mobility-based clusteringSiyuan Liu, Yunhuai Liu, Lionel M. Ni, Jianping Fan 0002, Minglu Li. 919-928 [doi]
• PET: a statistical model for popular events tracking in social communitiesCindy Xide Lin, Bo Zhao, Qiaozhu Mei, Jiawei Han. 929-938 [doi]
• The community-search problem and how to plan a successful cocktail partyMauro Sozio, Aristides Gionis. 939-948 [doi]
• Growing a tree in the forest: constructing folksonomies by integrating structured metadataAnon Plangprasopchok, Kristina Lerman, Lise Getoor. 949-958 [doi]
• A probabilistic model for personalized tag predictionDawei Yin, Zhenzhen Xue, Liangjie Hong, Brian D. Davison. 959-968 [doi]
• BioSnowball: automated population of WikisXiaojiang Liu, Zaiqing Nie, Nenghai Yu, Ji-Rong Wen. 969-978 [doi]
• Combined regression and rankingD. Sculley. 979-988 [doi]
• Mass estimation and its applicationsKai Ming Ting, Guang-Tong Zhou, Fei Tony Liu, James Swee Chuan Tan. 989-998 [doi]
• Multi-label learning by exploiting label dependencyMin-Ling Zhang, Kun Zhang. 999-1008 [doi]
• DivRank: the interplay of prestige and diversity in information networksQiaozhu Mei, Jian Guo, Dragomir R. Radev. 1009-1018 [doi]
• Inferring networks of diffusion and influenceManuel Gomez-Rodriguez, Jure Leskovec, Andreas Krause. 1019-1028 [doi]
• Scalable influence maximization for prevalent viral marketing in large-scale social networksWei Chen, Chi Wang, Yajun Wang. 1029-1038 [doi]
• Community-based greedy algorithm for mining top-K influential nodes in mobile social networksYu Wang, Gao Cong, Guojie Song, Kunqing Xie. 1039-1048 [doi]
• Social action tracking via noise tolerant time-varying factor graphsChenhao Tan, Jie Tang, Jimeng Sun, Quan Lin, Fengjiao Wang. 1049-1058 [doi]
• Finding effectors in social networksTheodoros Lappas, Evimaria Terzi, Dimitrios Gunopulos, Heikki Mannila. 1059-1068 [doi]
• GLS-SOD: a generalized local statistical approach for spatial outlier detectionFeng Chen, Chang-Tien Lu, Arnold P. Boedihardjo. 1069-1078 [doi]
• Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corporaJianwen Zhang, Yangqiu Song, Changshui Zhang, Shixia Liu. 1079-1088 [doi]
• Online discovery and maintenance of time series motifsAbdullah Mueen, Eamonn J. Keogh. 1089-1098 [doi]
• Mining periodic behaviors for moving objectsZhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, Peter Nye. 1099-1108 [doi]
• An efficient causal discovery algorithm for linear modelsZhenxing Wang, Laiwan Chan. 1109-1118 [doi]
• Compressed fisher linear discriminant analysis: classification of randomly projected dataRobert J. Durrant, Ata Kaban. 1119-1128 [doi]
• Scalable similarity search with optimized kernel hashingJunfeng He, Wei Liu, Shih-Fu Chang. 1129-1138 [doi]
• Semi-supervised sparse metric learning using alternating linearization optimizationWei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, Peng Liu. 1139-1148 [doi]
• Universal multi-dimensional scalingArvind Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian. 1149-1158 [doi]
• Unsupervised transfer classification: application to text categorizationTianbao Yang, Rong Jin, Anil K. Jain, Yang Zhou, Wei Tong. 1159-1168 [doi]
• Nonnegative shared subspace learning and its application to social media retrievalSunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Truyen Tran, Svetha Venkatesh. 1169-1178 [doi]
• Learning incoherent sparse and low-rank patterns from multiple tasksJianhui Chen, Ji Liu, Jieping Ye. 1179-1188 [doi]
• Multi-task learning for boosting with application to web search rankingOlivier Chapelle, Pannagadatta K. Shivaswamy, Srinivas Vadrevu, Kilian Q. Weinberger, Ya Zhang, Belle L. Tseng. 1189-1198 [doi]
• Transfer metric learning by learning task relationshipsYu Zhang, Dit-Yan Yeung. 1199-1208 [doi]
• The next generation of transportation systems, greenhouse emissions, and data miningHillol Kargupta, Joao Gama, Wei Fan. 1209-1212 [doi]