As in previous years, KDD-2010 will feature its extremely popular poster sessions. The authors of each accepted paper (both in the Research track and in the Industry & Government track) will be given an opportunity to present their work in a poster session in addition to the regular oral presentation. The poster sessions are held in the evening, and hors d'oeuvres will be served!

Date: Monday, July 26, 2010
Time: 6:15pm - 8:45pm
Location: Independence Center B, floor 1

1. Mining Advisor-Advisee Relationships from Resaerch Publication Networks
   Wang et al.
2. Estimating Rates of Rare Events with Multiple Hierarchies through Scalable Log-linear Models
   Agarwal et al.
3. User Browsing Models: Relevance versus Examination
   Srikant et al.
4. Suggesting Friends Using the Implicit Social Graph
   Roth et al.
5. New Perspectives and Methods in Link Prediction
   Lichtenwalter et al.
6. UP-Growth: An Efficient Algorithm for High Utility Itemsets Mining
   Tseng et al.
7. Frequent Regular Itemset Mining
   Ruggieri
8. Mining Uncertain Data with Probabilistic Guarantees
   Sun et al.
9. Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows
   Lam and Calders
10. Probably the Best Itemsets
    Tatti
11. Grafting-Light: Fast, Incremental Feature Selection and Structure Learning of Markov Random Fields
    Zhu et al.
12. A Scalable Two-Stage Approach for a Class of Dimensionality Reduction Techniques
    Sun et al.
13. An Efficient Algorithm for a Class of Fused Lasso Problems
    Liu et al.
14. Unsupervised Feature Selection for Multi-Cluster Data
    Cai et al.
15. Feature Selection for Support Vector Regression Using Probabilistic Prediction
    Ong and Yang
16. Versatile Publishing for Privacy Preservation
    Jin et al.
17. Privacy-Preserving Outsourcing Support Vector Machines with Privacy Transformation
    Chen and Lin
18. On the Quality of Inferring Interests From Social Neighbors
    Wen and Lin
19. DUST: A Generalized Notion of Similarity between Uncertain Time Series
    Sarangi and Murthy
20. Cold Start Link Prediction
    Leroy et al.
21. Learning with Cost Intervals
    Liu and Zhou
22. The new Iris Data: Modular Data Generators
    Adae and Berthold
23. Why label when you can search? Strategies for applying human resources to build classification models under extreme class imbalance
    Attenberg and Provost
24. Discovering Significant Relaxed Order-Preserving Submatrices
    Fang et al.
25. Topic Dynamics: an alternative model of `Bursts' in Streams of Topics
    He and Parker
26. Extracting Temporal Signatures for Comprehending Systems Biology Models
    Sundaravaradan et al.
27. Negative correlations in collaboration: concepts and algorithms
    Li et al.
28. k-Support Anonymity based on Pseudo Taxonomy for Outsourcing of Frequent Itemset Mining
    Tai et al.
29. Collusion-Resistant Privacy-Preserving Data Mining
    Yang et al.
30. Data Mining with Differential Privacy
    Friedman and Schuster
31. Discovering frequent patterns in sensitive data
    Bhaskar et al.
32. Fast Nearest Neighbor Search in Disk-resident Graphs
    Sarkar and Moore
33. Balanced Allocation with Succinct Representation
    Alaei et al.
34. Neighbor Query Friendly Compression of Social Networks
    Maserrat and Pei
35. Parallel SimRank Computation on Large Graphs with Iterative Aggregation
    He et al.
36. Dynamics of Conversations
    Kumar et al.
37. Flexible Constrained Spectral Clustering
    Wang and Davidson
38. A Hierarchical Information Theoretic Technique for the Discovery of Non Linear Alternative Clusterings
    Dang and Bailey
39. Clustering by Synchronization
    Bshm et al.
40. Unifying Dependent Clustering and Disparate Clustering for Non-homogeneous Data
    Hossain et al.
41. Fast Euclidean Minimum Spanning Tree: Algorithm, Analysis, Applications
    March et al.
42. Mining Program Workflow from Interleaved Traces
    Lou et al.
43. Connecting the Dots Between News Articles
    Shahaf and Guestrin
44. Discovering Probabilistic Frequent Subgraphs over Uncertain Graph Databases
    Zou et al.
45. Boosting with Structure Information in the Functional Space: an Application to Graph Classification
    Fei and Huan
46. Discriminative Topic Modeling based on Manifold Learning
    Huh and Fienberg
47. Online Multiscale Dynamic Topic Models
    Iwata et al.
48. Topic Models with Power-Law Using Pitman-Yor Process
    Sato and Nakagawa
49. The Topic-Perspective Model for Social Tagging Systems
    Lu et al.
50. Combining Predictions for Accurate Recommender Systems
    Jahrer et al.
51. Fast Online Learning through Effective Offline Initialization for Time-Sensitive Recommendation
    Chen et al.
52. Training and Testing of Recommender Systems on Data Missing Not at Random
    Steck
53. Temporal Recommendation on Graphs via Long- and Short-term Preference Fusion
    Xiang et al.
54. Generative Models for Ticket Resolution in Expert Networks
    Miao et al.

Go to top

55. Evaluating Online Ad Campaigns in a Pipeline: Causal Models At Scale
    Lambert et al.
56. Overlapping Experiment Infrastructure: More, Better, Faster Experimentation
    Tang et al.
57. Exploitation and Exploration in a Performance based Contextual Advertising System
    Li et al.
58. MineFleet: An Overview of a Widely Adopted Distributed Vehicle Performance Data Mining System
    Kargupta et al.
59. Multiple Kernel Learning for Heterogeneous Anomaly Detection: Algorithm and Aviation Safety Case Study
    Das et al.

Go to top

---

Date: Tuesday, July 27, 2010
Time: 5:45pm - 8:00pm
Location: Independence Center B, floor 1

1. Semi-supervised Feature Selection for Graph Classification
   Kong and Yu
2. Modeling Relational Events via Latent Classes
   DuBois and Smyth
3. Community Outliers and their Efficient Detection in Information Networks
   Gao et al.
4. Redefining Class Definitions using Constraint-Based Clustering
   Preston et al.
5. Discovery of Significant Emerging Trends
   Ungar and Goorha
6. Data Mining to Predict and Prevent Errors in Health Insurance Claims Processing
   Kumar et al.
7. Optimizing Debt Collections Using Constrained Reinforcement Learning
   Abe et al.
8. Detecting Abnormal Coupled Sequences and Sequence Changes in Group-based Manipulative Trading Behaviors
   Cao et al.
9. Large Linear Classification When Data Cannot Fit In Memory
   Yu et al.
10. Class-Specific Error Bounds for Ensemble Classifiers
    Prenger et al.
11. Designing efficient cascaded classifiers: Tradeoff between accuracy and cost
    Raykar et al.
12. Direct Mining of Discriminative Patterns for Classifying Uncertain Data
    Gao and Wang
13. Ensemble Pruning via Individual Contribution Ordering
    Lu et al.
14. Fast Query Execution for Retrieval Models based on Path Constraint Random Walks
    Lao and Cohen
15. Trust Network Inference for Online Rating Data Using Generative Models
    Chua and Lim
16. An Energy-Efficient Mobile Recommender System
    Xiong et al.
17. A POWER Framework for Multi-Class Membership in Bayesian Mixture Models
    Somaiya et al.
18. Towards Mobility-based Clustering
    Liu et al.
19. A Statistical Model for Popular Event Tracking in Social Communities
    Lin et al.
20. The community-search problem and how to plan a successful cocktail party
    Sozio and Gionis
21. Growing a tree in the forest: constructing folksonomies by integrating structured metadata
    Plangprasopchok et al.
22. A Probabilistic Model for Personalized Tag Prediction
    Yin et al.
23. BioSnowball: Automated Population of Wikis
    Liu et al.
24. Combined Regression and Ranking
    Sculley
25. Mass Estimation and Its Applications
    Ting et al.
26. Multi-Label Learning by Exploiting Label Dependency
    Zhang and Zhang
27. DivRank: the Interplay of Prestige and Diversity in Information Networks
    Mei et al.
28. Inferring Networks of Diffusion and Influence
    Rodriguez et al.
29. Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks
    Chen et al.
30. Community-based Greedy Algorithm for Mining Top-K Influential Nodes in Mobile Social Networks
    Wang et al.
31. Social Action Tracking via Noise Tolerant Time-varying Factor Graphs
    Tan et al.
32. Finding Effectors in Social Networks
    Lappas et al.
33. GLS-SOD: A Generalized Local Statistical Approach for Spatial Outlier Detection
    Chen et al.
34. Evolutionary Hierarchical Dirichlet Processes for Multiple Correlated Time-varying Corpora
    Zhang et al.
35. Online Discovery and Maintenance of Time Series Motifs
    Mueen and Keogh
36. Mining Hidden Periodic Behaviors for Moving Objects
    Li et al.
37. An efficient causal discovery algorithm for linear models
    Wang and Chan
38. Compressed Fisher Linear Discriminant Analysis: Classification of Randomly Projected Data
    Durrant and Kaban
39. Scalable Similarity Search with Optimized Kernel Hashing
    He et al.
40. Semi-Supervised and Sparse Metric Learning Using Alternating Direction Optimization
    Liu et al.
41. A Unified Algorithmic Framework for Multi-Dimensional Scaling
    Agarwal et al.
42. Unsupervised Transfer Learning: Application to Text Categorization
    Yang et al.
43. Nonnegative Shared Subspace Learning and Its Application to Social Media Retrieval
    Gupta et al.
44. Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
    Chen et al.
45. Multi-Task Learning for Boosting with Application to Web Search Ranking
    Chapelle et al.
46. Transfer Metric Learning by Learning Task Relationships
    Zhang and Yeung
47. Learning to Combine Discriminative Classifiers
    Lee
48. Mining Positive and Negative Patterns for Relevance Feature Discovery
    Li et al.
49. Document Clustering via Dirichlet Process Mixture Model with Feature Selection
    Yu et al.
50. Semantic Relation Extraction With Kernels Over Typed Dependency Trees
    Reichartz et al.
51. Latent Aspect Rating Analysis on Review Text Data: A Rating Regression Approach
    Wang et al.

Go to top

52. Automatic Malware Categorization Using Cluster Ensemble
    Ye et al.
53. Beyond Heuristics: Learning to Classify Vulnerabilities and Predict Exploits
    Bozorgi et al.
54. Diagnosing Memory Leaks using Graph Mining on Heap Dumps
    Maxwell et al.
55. Using Data Mining Techniques to Address Critical Information Exchange Needs in Disaster Affected Public-Private Networks
    Zheng et al.
56. Tropical Cyclone Event Sequence Similarity Search via Dimensionality Reduction and Metric Learning
    Ho et al.
57. MalStone: Towards A Benchmark for Analytics on Large Data Clouds
    Bennettp et al.
58. TIARA: A Visual Exploratory Text Analytic System
    Wei et al.
59. MetricForensics: A Multi-Level Approach for Mining Volatile Graphs
    Eliassi-Rad et al.
60. Active Learning for Biomedical Citation Screening
    Wallace et al.
61. An Integrated Machine Learning Approach to Stroke Prediction
    Cao et al.
62. Medical Coding Classification by Leveraging Inter-Code Relationships
    Yan et al.

Go to top

---