Table of Contents

• Self-Organizing wireless sensor networks in actionJohn A. Stankovic. 1 [doi]
• New cached-sufficient statistics algorithms for quickly answering statistical questionsAndrew Moore. 2 [doi]
• Next frontierRakesh Agrawal. 3 [doi]
• Deriving quantitative models for correlation clustersElke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek. 4-13 [doi]
• Learning to rank networked entitiesAlekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal. 14-23 [doi]
• Spatial scan statistics: approximations and performance studyDeepak Agarwal, Andrew McGregor, Jeff M. Phillips, Suresh Venkatasubramanian, Zhengyuan Zhu. 24-33 [doi]
• Global distance-based segmentation of trajectoriesAris Anagnostopoulos, Michail Vlachos, Marios Hadjieleftheriou, Eamonn J. Keogh, Philip S. Yu. 34-43 [doi]
• Group formation in large social networks: membership, growth, and evolutionLars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, Xiangyang Lan. 44-54 [doi]
• Detecting outliers using transduction and statistical testingDaniel Barbará, Carlotta Domeniconi, James P. Rogers. 55-64 [doi]
• Robust information-theoretic clusteringChristian Böhm, Christos Faloutsos, Jia-Yu Pan, Claudia Plant. 65-75 [doi]
• Efficient anonymity-preserving data collectionJustin Brickell, Vitaly Shmatikov. 76-85 [doi]
• Out-of-core frequent pattern mining on a commodity PCGregory Buehrer, Srinivasan Parthasarathy, Amol Ghoting. 86-95 [doi]
• Mining rank-correlated sets of numerical attributesToon Calders, Bart Goethals, Szymon Jaroszewicz. 96-105 [doi]
• NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifsJin Chen, Wynne Hsu, Mong-Li Lee, See-Kiong Ng. 106-115 [doi]
• Estimating the global pagerank of web communitiesJason V. Davis, Inderjit S. Dhillon. 116-125 [doi]
• Orthogonal nonnegative matrix t-factorizations for clusteringChris H. Q. Ding, Tao Li, Wei Peng, Haesun Park. 126-135 [doi]
• A general framework for accurate and fast regression by data summarization in random decision treesWei Fan, Joe McCloskey, Philip S. Yu. 136-146 [doi]
• Reverse testing: an efficient framework to select amongst classifiers under sample selection biasWei Fan, Ian Davidson. 147-156 [doi]
• Quantifying trends accurately despite classifier error and class imbalanceGeorge Forman. 157-166 [doi]
• Assessing data mining results via swap randomizationAristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. 167-176 [doi]
• A new efficient probabilistic model for mining labeled ordered treesKosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhisa Ueda, Minoru Kanehisa, Hiroshi Mamitsuka. 177-186 [doi]
• Learning the unified kernel machines for classificationSteven C. H. Hoi, Michael R. Lyu, Edward Y. Chang. 187-196 [doi]
• Frequent subgraph mining in outerplanar graphsTamás Horváth, Jan Ramon, Stefan Wrobel. 197-206 [doi]
• Adaptive event detection with time-varying poisson processesAlexander T. Ihler, Jon Hutchins, Padhraic Smyth. 207-216 [doi]
• Training linear SVMs in linear timeThorsten Joachims. 217-226 [doi]
• Mining quantitative correlated patterns using an information-theoretic approachYiping Ke, James Cheng, Wilfred Ng. 227-236 [doi]
• Maximally informative k-itemsets and their efficient discoveryArno J. Knobbe, Eric K. Y. Ho. 237-244 [doi]
• Measuring and extracting proximity in networksYehuda Koren, Stephen C. North, Chris Volinsky. 245-255 [doi]
• Hierarchical topic segmentation of websitesRavi Kumar, Kunal Punera, Andrew Tomkins. 257-266 [doi]
• New EM derived from Kullback-Leibler divergenceLongin Jan Latecki, Marc Sobel, Rolf Lakämper. 267-276 [doi]
• Workload-aware anonymizationKristen LeFevre, David J. DeWitt, Raghu Ramakrishnan. 277-286 [doi]
• Very sparse random projectionsPing Li, Trevor Hastie, Kenneth Ward Church. 287-296 [doi]
• Rule interestingness analysis using OLAP operationsBing Liu, Kaidi Zhao, Jeffrey Benkler, Weimin Xiao. 297-306 [doi]
• Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagramsElsa Loekito, James Bailey. 307-316 [doi]
• Unsupervised learning on k-partite graphsBo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip S. Yu. 317-326 [doi]
• Tensor-CUR decompositions for tensor-based dataMichael W. Mahoney, Mauro Maggioni, Petros Drineas. 327-336 [doi]
• Generating semantic annotations for frequent patterns with context analysisQiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, ChengXiang Zhai. 337-346 [doi]
• Aggregating time partitionsTaneli Mielikäinen, Evimaria Terzi, Panayiotis Tsaparas. 347-356 [doi]
• Using structure indices for efficient approximation of network propertiesMatthew J. Rattigan, Marc Maier, David Jensen. 357-366 [doi]
• Learning sparse metrics via linear programmingRómer Rosales, Glenn Fung. 367-373 [doi]
• Beyond streams and graphs: dynamic tensor analysisJimeng Sun, Dacheng Tao, Christos Faloutsos. 374-383 [doi]
• Acclimatizing taxonomic semantics for hierarchical content classification from semantics to data-driven taxonomyLei Tang, Jianping Zhang, Huan Liu. 384-393 [doi]
• Mining distance-based outliers from large databases in any metric spaceYufei Tao, Xiaokui Xiao, Shuigeng Zhou. 394-403 [doi]
• Center-piece subgraphs: problem definition and fast solutionsHanghang Tong, Christos Faloutsos. 404-413 [doi]
• Anonymizing sequential releasesKe Wang, Benjamin C. M. Fung. 414-423 [doi]
• Topics over time: a non-Markov continuous-time model of topical trendsXuerui Wang, Andrew McCallum. 424-433 [doi]
• Discovering significant rulesGeoffrey I. Webb. 434-443 [doi]
• Extracting redundancy-aware top-k patternsDong Xin, Hong Cheng, Xifeng Yan, Jiawei Han. 444-453 [doi]
• Regularized discriminant analysis for high dimensional, low sample size dataJieping Ye, Tie Wang. 454-463 [doi]
• Supervised probabilistic principal component analysisShipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Kriegel, Mingrui Wu. 464-473 [doi]
• Extracting key-substring-group features for text classificationDell Zhang, Wee Sun Lee. 474-483 [doi]
• Event detection from evolution of click-through dataQiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei-Ying Ma. 484-493 [doi]
• Simultaneous record detection and attribute labeling in web data extractionJun Zhu, Zaiqing Nie, Ji-Rong Wen, Bo Zhang, Wei-Ying Ma. 494-503 [doi]
• Outlier detection by active learningNaoki Abe, Bianca Zadrozny, John Langford. 504-509 [doi]
• On privacy preservation against adversarial data miningCharu C. Aggarwal, Jian Pei, Bo Zhang 0002. 510-516 [doi]
• CCCS: a top-down associative classifier for imbalanced class distributionBavani Arunasalam, Sanjay Chawla. 517-522 [doi]
• A framework for analysis of dynamic social networksTanya Y. Berger-Wolf, Jared Saia. 523-528 [doi]
• Query-time entity resolutionIndrajit Bhattacharya, Lise Getoor, Louis Licamele. 529-534 [doi]
• Model compressionCristian Bucila, Rich Caruana, Alexandru Niculescu-Mizil. 535-541 [doi]
• Classification features for attack detection in collaborative recommender systemsRobin D. Burke, Bamshad Mobasher, Chad Williams, Runa Bhaumik. 542-547 [doi]
• Single-pass online learning: performance, voting schemes and online feature selectionVitor R. Carvalho, William W. Cohen. 548-553 [doi]
• Evolutionary clusteringDeepayan Chakrabarti, Ravi Kumar, Andrew Tomkins. 554-560 [doi]
• Algorithms for discovering bucket orders from dataAristides Gionis, Heikki Mannila, Kai Puolamäki, Antti Ukkonen. 561-566 [doi]
• Mining relational data through correlation-based multiple view validationHongyu Guo, Herna L. Viktor. 567-573 [doi]
• Recommendation method for extending subscription periodsTomoharu Iwata, Kazumi Saito, Takeshi Yamada. 574-579 [doi]
• Dynamic, real-time forecasting of online auctions via functional modelsWolfgang Jank, Galit Shmueli, Shanshan Wang. 580-585 [doi]
• Polynomial association rules with applications to logistic regressionSzymon Jaroszewicz. 586-591 [doi]
• CFI-Stream: mining closed frequent itemsets in data streamsNan Jiang, Le Gruenwald. 592-597 [doi]
• Reducing the human overhead in text categorizationArnd Christian König, Eric Brill. 598-603 [doi]
• Algorithms for storytellingDeept Kumar, Naren Ramakrishnan, Richard F. Helm, Malcolm Potts. 604-610 [doi]
• Structure and evolution of online social networksRavi Kumar, Jasmine Novak, Andrew Tomkins. 611-617 [doi]
• Cryptographically private support vector machinesSven Laur, Helger Lipmaa, Taneli Mielikäinen. 618-624 [doi]
• Bias and controversy: beyond the statistical deviationHady Wirawan Lauw, Ee-Peng Lim, Ke Wang. 625-630 [doi]
• Sampling from large graphsJure Leskovec, Christos Faloutsos. 631-636 [doi]
• Clustering pair-wise dissimilarity data into partially ordered setsJinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMillan, Jan Prins. 637-642 [doi]
• Visual data mining using principled projection algorithms and information visualization techniquesDharmesh M. Maniyar, Ian T. Nabney. 643-648 [doi]
• A mixture model for contextual text miningQiaozhu Mei, ChengXiang Zhai. 649-655 [doi]
• A new multi-view regression approach with an application to customer wallet estimationSrujana Merugu, Saharon Rosset, Claudia Perlich. 656-661 [doi]
• Efficient multidimensional data representations based on multiple correspondence analysisRiadh Ben Messaoud, Omar Boussaid, Sabine Loudcher Rabaséda. 662-667 [doi]
• Algorithms for time series knowledge miningFabian Mörchen. 668-673 [doi]
• Clustering based large margin classification: a scalable approach using SOCP formulationJ. Saketha Nath, Chiranjib Bhattacharyya, M. Narasimha Murty. 674-679 [doi]
• Statistical entity-topic modelsDavid Newman, Chaitanya Chemudugunta, Padhraic Smyth. 680-686 [doi]
• Mining for misconfigured machines in grid systemsNoam Palatin, Arie Leizarowitz, Assaf Schuster, Ran Wolff. 687-692 [doi]
• Automatic mining of fruit fly embryo imagesJia-Yu Pan, André G. R. Balan, Eric P. Xing, Agma J. M. Traina, Christos Faloutsos. 693-698 [doi]
• Naïve filterbots for robust cold-start recommendationsSeung-Taek Park, David Pennock, Omid Madani, Nathan Good, Dennis DeCoste. 699-705 [doi]
• MONIC: modeling and monitoring cluster transitionsMyra Spiliopoulou, Irene Ntoutsi, Yannis Theodoridis, Rene Schult. 706-711 [doi]
• Combining linguistic and statistical analysis to extract relations from web documentsFabian M. Suchanek, Georgiana Ifrim, Gerhard Weikum. 712-717 [doi]
• Mining long-term search history to improve search accuracyBin Tan, Xuehua Shen, ChengXiang Zhai. 718-723 [doi]
• Efficient kernel feature extraction for massive data setsIvor W. Tsang, András Kocsor, James T. Kwok. 724-729 [doi]
• Summarizing itemset patterns using probabilistic modelsChao Wang, Srinivasan Parthasarathy. 730-735 [doi]
• Suppressing model overfitting in mining concept-drifting data streamsHaixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jeffrey Xu Yu. 736-741 [doi]
• A large-scale analysis of query logs for assessing personalization opportunitiesSteve Wedig, Omid Madani. 742-747 [doi]
• Semi-supervised time series classificationLi Wei, Eamonn J. Keogh. 748-753 [doi]
• (alpha, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishingRaymond Chi-Wing Wong, Jiuyong Li, Ada Wai-Chee Fu, Ke Wang. 754-759 [doi]
• Incremental approximate matrix factorization for speeding up support vector machinesGang Wu, Edward Y. Chang, Yen-Kuang Chen, Christoper Hughes. 760-766 [doi]
• Outlier detection by sampling with accuracy guaranteesMingxi Wu, Chris Jermaine. 767-772 [doi]
• Discovering interesting patterns through user s interactive feedbackDong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han. 773-778 [doi]
• K-means clustering versus validation measures: a data distribution perspectiveHui Xiong, Junjie Wu, Jian Chen. 779-784 [doi]
• Utility-based anonymization using local recodingJian Xu, Wei Wang 0009, Jian Pei, Xiaoyuan Wang, Baile Shi, Ada Wai-Chee Fu. 785-790 [doi]
• Integration of semantic-based bipartite graph representation and mutual refinement strategy for biomedical literature clusteringIllhoi Yoo, Xiaohua Hu, Il-Yeol Song. 791-796 [doi]
• Coherent closed quasi-clique discovery from large dense graph databasesZhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis. 797-802 [doi]
• Mining progressive confident rulesMinghua Zhang, Wynne Hsu, Mong-Li Lee. 803-808 [doi]
• Attack detection in time series for recommender systemsSheng Zhang, Amit Chakrabarti, James Ford, Fillia Makedon. 809-814 [doi]
• Identifying bridging rules between conceptual clustersShichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhang. 815-820 [doi]
• Linear prediction models with graph regularization for web-page categorizationTong Zhang, Alexandrin Popescul, Byron Dom. 821-826 [doi]
• BLOSOM: a framework for mining arbitrary boolean expressionsLizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishnan. 827-832 [doi]
• Introducing perpetual analyticsJeff Jonas. 833 [doi]
• Capital One s statistical problems: our top ten listWilliam Kahn. 834 [doi]
• Information extraction, data mining and joint inferenceAndrew McCallum. 835 [doi]
• Data mining challenges in the automotive domainMichael Cavaretta. 836 [doi]
• Computer aided detection via asymmetric cascade of sparse hyperplane classifiersJinbo Bi, Senthil Periaswamy, Kazunori Okada, Toshiro Kubota, Glenn Fung, Marcos Salganicoff, R. Bharat Rao. 837-844 [doi]
• Onboard classifiers for science event detection on a remote sensing spacecraftRebecca Castaño, Dominic Mazzoni, Nghia Tang, Ronald Greeley, Thomas Doggett, Benjamin Cichy, Steve A. Chien, Ashley Davies. 845-851 [doi]
• Pragmatic text mining: minimizing human effort to quantify many issues in call logsGeorge Forman, Evan Kirshenbaum, Jaap Suermondt. 852-861 [doi]
• Mining for proposal reviewers: lessons learned at the national science foundationSeth Hettich, Michael J. Pazzani. 862-871 [doi]
• GPLAG: detection of software plagiarism by program dependence graph analysisChao Liu, Chen Chen, Jiawei Han, Philip S. Yu. 872-881 [doi]
• Understandable models Of music collections based on exhaustive feature generation with temporal statisticsFabian Mörchen, Ingo Mierswa, Alfred Ultsch. 882-891 [doi]
• Opportunity map: identifying causes of failure - a deployed data mining systemKaidi Zhao, Bing Liu, Jeffrey Benkler, Weimin Xiao. 892-901 [doi]
• Identifying best bet web search results by mining past user behaviorEugene Agichtein, Zijian Zheng. 902-908 [doi]
• Mining citizen science data to predict orevalence of wild bird speciesRich Caruana, Mohamed Farid Elhawary, Art Munson, Mirek Riedewald, Daria Sorokina, Daniel Fink, Wesley M. Hochachka, Steve Kelling. 909-915 [doi]
• A component-based framework for knowledge discovery in bioinformaticsJulien Etienne, Bernd Wachmann, Lei Zhang. 916-921 [doi]
• Discovering significant OPSM subspace clusters in massive gene expression dataByron J. Gao, Obi L. Griffith, Martin Ester, Steven J. M. Jones. 922-928 [doi]
• Maximum profit mining and its application in software developmentCharles X. Ling, Victor S. Sheng, Tilmann F. W. Bruckhaus, Nazim H. Madhavji. 929-934 [doi]
• YALE: rapid prototyping for complex data mining tasksIngo Mierswa, Michael Wurst, Ralf Klinkenberg, Martin Scholz, Timm Euler. 935-940 [doi]
• Camouflaged fraud detection in domains with complex relationshipsSankar Virdhagriswaran, Gordon Dakin. 941-947 [doi]
• Beyond classification and ranking: constrained optimization of the ROILian Yan, Patrick Baldasare. 948-953 [doi]
• Is there a grand challenge or X-prize for data mining?Gregory Piatetsky-Shapiro, Robert Grossman, Chabane Djeraba, Ronen Feldman, Lise Getoor, Mohammed Javeed Zaki. 954-956 [doi]