Table of Contents

• Incentive networksPrabhakar Raghavan. 1 [doi]
• Mining the internet: the eighth wonder of the worldGian Fulgoni. 2 [doi]
• The architecture of complexity: the structure and the dynamics of networks, from the web to the cellAlbert-László Barabási. 3 [doi]
• A Bayesian network classifier with inverse tree structure for voxelwise magnetic resonance image analysisRong Chen, Edward Herskovits. 4-12 [doi]
• Variable latent semantic indexingAnirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins. 13-21 [doi]
• Mining images on semantics via statistical learningJianping Fan, Hangzai Luo, Mohand-Said Hacid. 22-31 [doi]
• Rule extraction from linear support vector machinesGlenn Fung, Sathyakama Sandilya, R. Bharat Rao. 32-40 [doi]
• Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clusteringBin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, Wei-Ying Ma. 41-50 [doi]
• Dimension induced clusteringAristides Gionis, Alexander Hinneburg, Spiros Papadimitriou, Panayiotis Tsaparas. 51-60 [doi]
• Mining tree queries in a graphBart Goethals, Eveline Hoekx, Jan Van den Bussche. 61-69 [doi]
• Non-redundant clustering with conditional ensemblesDavid Gondek, Thomas Hofmann. 70-77 [doi]
• The predictive power of online chatterDaniel Gruhl, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, Andrew Tomkins. 78-87 [doi]
• Wavelet synopsis for data streams: minimizing non-euclidean errorSudipto Guha, Boulos Harb. 88-97 [doi]
• Combining email models for false positive reductionShlomo Hershkop, Salvatore J. Stolfo. 98-107 [doi]
• Nomograms for visualizing support vector machinesAleks Jakulin, Martin Mozina, Janez Demsar, Ivan Bratko, Blaz Zupan. 108-117 [doi]
• Fast discovery of unexpected patterns in data, relative to a Bayesian networkSzymon Jaroszewicz, Tobias Scheffer. 118-127 [doi]
• Local sparsity control for naive Bayes with extreme misclassification costsAleksander Kolcz. 128-137 [doi]
• A multiple tree algorithm for the efficient association of asteroid observationsJeremy Kubica, Andrew W. Moore, Andrew Connolly, Robert Jedicke. 138-146 [doi]
• Combining partitions by probabilistic label aggregationTilman Lange, Joachim M. Buhmann. 147-156 [doi]
• Feature bagging for outlier detectionAleksandar Lazarevic, Vipin Kumar. 157-166 [doi]
• Simple and effective visual models for gene expression cancer diagnosticsGregor Leban, Minca Mramor, Ivan Bratko, Blaz Zupan. 167-176 [doi]
• Graphs over time: densification laws, shrinking diameters and possible explanationsJure Leskovec, Jon M. Kleinberg, Christos Faloutsos. 177-187 [doi]
• A general model for clustering binary dataTao Li. 188-197 [doi]
• Discovering evolutionary theme patterns from text: an exploration of temporal text miningQiaozhu Mei, ChengXiang Zhai. 198-207 [doi]
• A distributed learning framework for heterogeneous data sourcesSrujana Merugu, Joydeep Ghosh. 208-217 [doi]
• Detection of emerging space-time clustersDaniel B. Neill, Andrew W. Moore, Maheshkumar Sabhnani, Kenny Daniel. 218-227 [doi]
• On mining cross-graph quasi-cliquesJian Pei, Daxin Jiang, Aidong Zhang. 228-238 [doi]
• Query chains: learning to rank from implicit feedbackFilip Radlinski, Thorsten Joachims. 239-248 [doi]
• Robust boosting and its relation to baggingSaharon Rosset. 249-255 [doi]
• On the use of linear programming for unsupervised text classificationMark Sandler. 256-264 [doi]
• Sampling-based sequential subgroup miningMartin Scholz. 265-274 [doi]
• Probabilistic workflow miningRicardo Silva, Jiji Zhang, James G. Shanahan. 275-284 [doi]
• Finding partial orders from unordered 0-1 dataAntti Ukkonen, Mikael Fortelius, Heikki Mannila. 285-293 [doi]
• Web object indexing using domain knowledgeMuyuan Wang, Zhiwei Li, Lie Lu, Wei-Ying Ma, Naiyao Zhang. 294-303 [doi]
• Improving discriminative sequential learning with rare--but--important associationsXuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu Horiguchi. 304-313 [doi]
• Summarizing itemset patterns: a profile-based approachXifeng Yan, Hong Cheng, Jiawei Han, Dong Xin. 314-323 [doi]
• Mining closed relational graphs with connectivity constraintsXifeng Yan, Xianghong Jasmine Zhou, Jiawei Han. 324-333 [doi]
• Anonymity-preserving data collectionZhiqiang Yang, Sheng Zhong, Rebecca N. Wright. 334-343 [doi]
• Cross-relational clustering with user s guidanceXiaoxin Yin, Jiawei Han, Philip S. Yu. 344-353 [doi]
• SVM selective sampling for ranking with application to data retrievalHwanjo Yu. 354-363 [doi]
• Reasoning about sets using redescription miningMohammed Javeed Zaki, Naren Ramakrishnan. 364-373 [doi]
• A new scheme on privacy-preserving data classificationNan Zhang 0004, Shengquan Wang, Wei Zhao. 374-383 [doi]
• Streaming feature selection using alpha-investingJing Zhou, Dean P. Foster, Robert A. Stine, Lyle H. Ungar. 384-393 [doi]
• Finding similar files in large document repositoriesGeorge Forman, Kave Eshghi, Stephane Chiocchetti. 394-400 [doi]
• An approach to spacecraft anomaly detection problem using kernel feature spaceRyohei Fujimaki, Takehisa Yairi, Kazuo Machida. 401-410 [doi]
• Price prediction and insurance for online auctionsRayid Ghani. 411-418 [doi]
• Deriving marketing intelligence from online discussionNatalie S. Glance, Matthew Hurst, Kamal Nigam, Matthew Siegler, Robert Stockton, Takashi Tomokiyo. 419-428 [doi]
• Making holistic schema matching robust: an ensemble approachBin He, Kevin Chen-Chuan Chang. 429-438 [doi]
• Using retrieval measures to assess similarity in mining dynamic web clickstreamsOlfa Nasraoui, Cesar Cardona, Carlos Rojas. 439-448 [doi]
• Using relational knowledge discovery to prevent securities fraudJennifer Neville, Özgür Simsek, David Jensen, John Komoroske, Kelly Palmer, Henry G. Goldberg. 449-458 [doi]
• A hit-miss model for duplicate detection in the WHO drug safety databaseG. Niklas Norén, Roland Orre, Andrew Bate. 459-468 [doi]
• Predicting the product purchase patterns of corporate customersBhavani Raskutti, Alan Herschtal. 469-478 [doi]
• Modeling and predicting personal information dissemination behaviorXiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming-Ting Sun. 479-488 [doi]
• Email data cleaningJie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang. 489-498 [doi]
• Dynamic syslog mining for network failure monitoringKenji Yamanishi, Yuko Maruyama. 499-508 [doi]
• Enhancing the lift under budget constraints: an application in the mutual fund industryLian Yan, Michael Fassino, Patrick Baldasare. 509-515 [doi]
• Learning to predict train wheel failuresChunsheng Yang, Sylvain Létourneau. 516-525 [doi]
• Towards exploratory test instance specific algorithms for high dimensional classificationCharu C. Aggarwal. 526-531 [doi]
• Model-based overlapping clusteringArindam Banerjee, Chase Krumpelman, Joydeep Ghosh, Sugato Basu, Raymond J. Mooney. 532-537 [doi]
• Integration of profile hidden Markov model output into association rule miningChristopher Besemann, Anne Denton. 538-543 [doi]
• Scalable discovery of hidden emails from large foldersGiuseppe Carenini, Raymond T. Ng, Xiaodong Zhou. 544-549 [doi]
• Web mining from competitors websitesXin Chen, Yi-fang Brook Wu. 550-555 [doi]
• LIPED: HMM-based life profiles for adaptive event detectionChien Chin Chen, Meng Chang Chen, Ming-Syan Chen. 556-561 [doi]
• Parallel mining of closed sequential patternsShengnan Cong, Jiawei Han, David A. Padua. 562-567 [doi]
• Creating social networks to improve peer-to-peer networkingAndrew Fast, David Jensen, Brian Neil Levine. 568-573 [doi]
• Unweaving a web of documentsRamanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram. 574-579 [doi]
• Maximal boastingCinda Heeren, Leonard Pitt. 580-585 [doi]
• Application of kernels to link analysisTakahiko Ito, Masashi Shimbo, Taku Kudo, Yuji Matsumoto. 586-592 [doi]
• Privacy-preserving distributed k-means clustering over arbitrarily partitioned dataGeetha Jagannathan, Rebecca N. Wright. 593-599 [doi]
• Simultaneous optimization of complex mining tasks with a knowledgeable cacheRuoming Jin, Kaushik Sinha, Gagan Agrawal. 600-605 [doi]
• Discovering frequent topological structures from graph datasetsRuoming Jin, Chao Wang, Dmitrii Polshakov, Srinivasan Parthasarathy, Gagan Agrawal. 606-611 [doi]
• A maximum entropy web recommendation system: combining collaborative and content featuresXin Jin, Yanzan Zhou, Bamshad Mobasher. 612-617 [doi]
• Information retrieval based on collaborative filtering with latent interest semantic mapNoriaki Kawamae, Katsumi Takahashi. 618-623 [doi]
• Determining an author s native language by mining a text for errorsMoshe Koppel, Jonathan Schler, Kfir Zigdon. 624-628 [doi]
• A fast kernel-based multilevel algorithm for graph clusteringInderjit S. Dhillon, Yuqiang Guan, Brian Kulis. 629-634 [doi]
• Co-clustering by block value decompositionBo Long, Zhongfei (Mark) Zhang, Philip S. Yu. 635-640 [doi]
• Adversarial learningDaniel Lowd, Christopher Meek. 641-647 [doi]
• Estimating missed actual positives using independent classifiersSandeep Mane, Jaideep Srivastava, San-Yih Hwang. 648-653 [doi]
• Efficient computations via scalable sparse kernel partial least squares and boosted latent featuresMichinari Momma. 654-659 [doi]
• Optimizing time series discretization for knowledge discoveryFabian Mörchen, Alfred Ultsch. 660-665 [doi]
• Key semantics extraction by dependency tree miningSatoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine. 666-671 [doi]
• Density-based clustering of uncertain dataHans-Peter Kriegel, Martin Pfeifle. 672-677 [doi]
• Evaluating similarity measures: a large-scale study in the orkut social networkEllen Spertus, Mehran Sahami, Orkut Buyukkokten. 678-684 [doi]
• A hybrid unsupervised approach for document clusteringMihai Surdeanu, Jordi Turmo, Alicia Ageno. 685-690 [doi]
• Mining comparable bilingual text corpora for cross-language information integrationTao Tao, ChengXiang Zhai. 691-696 [doi]
• Regression error characteristic surfacesLuís Torgo. 697-702 [doi]
• Formulating distance functions via the kernel trickGang Wu, Edward Y. Chang, Navneet Panda. 703-709 [doi]
• Combining proactive and reactive predictions for data streamsYing Yang, Xindong Wu, Xingquan Zhu. 710-715 [doi]
• A generalized framework for mining spatio-temporal patterns in scientific dataHui Yang, Srinivasan Parthasarathy, Sameep Mehta. 716-721 [doi]
• Building connected neighborhood graphs for isometric data embeddingLi Yang. 722-728 [doi]
• Pattern lattice traversal by selective jumpsOsmar R. Zaïane, Mohammad El-Hajj. 729-735 [doi]
• CLICKS: an effective algorithm for mining subspace clusters in categorical datasetsMohammed Javeed Zaki, Markus Peters, Ira Assent, Thomas Seidl. 736-742 [doi]
• Fast window correlations over uncooperative time seriesRichard Cole, Dennis Shasha, Xiaojian Zhao. 743-749 [doi]
• Failure detection and localization in component based systems by online trackingHaifeng Chen, Guofei Jiang, Cristian Ungureanu, Kenji Yoshihira. 750-755 [doi]
• Generation of synthetic data sets for evaluating the accuracy of knowledge discovery systemsDaniel R. Jeske, Behrokh Samadi, Pengyue J. Lin, Lan Ye, Sean Cox, Rui Xiao, Ted Younglove, Minh Ly, Douglas Holt, Ryan Rich. 756-762 [doi]
• Data mining in the chemical industryAlex N. Kalos, Tim Rey. 763-769 [doi]
• Mining risk patterns in medical dataJiuyong Li, Ada Wai-Chee Fu, Hongxing He, Jie Chen, Huidong Jin, Damien McAullay, Graham J. Williams, Ross Sparks, Chris Kelman. 770-775 [doi]
• An integrated framework on mining logs files for computing system managementTao Li, Feng Liang, Sheng Ma, Wei Peng. 776-781 [doi]
• Automated detection of frontal systems from numerical model-generated dataXiang Li, Rahul Ramachandran, Sara J. Graves, Sunil Movva, Bilahari Akkiraju, David Emmitt, Steven Greco, Robert Atlas, Joseph Terry, Juan-Carlos Jusem. 782-787 [doi]
• Disease progression modeling from historical clinical databasesRonald K. Pearson, Robert J. Kingan, Alan Hochberg. 788-793 [doi]
• Mining rare and frequent events in multi-camera surveillance video using self-organizing mapsValery A. Petrushin. 794-800 [doi]
• Short term performance forecasting in enterprise systemsRob Powers, Moisés Goldszmidt, Ira Cohen. 801-807 [doi]
• A multinomial clustering model for fast simulation of computer architecture designsKaushal Sanghai, Ting Su, Jennifer G. Dy, David R. Kaeli. 808-813 [doi]
• Pattern-based similarity search for microarray dataHaixun Wang, Jian Pei, Philip S. Yu. 814-819 [doi]