“研究”目录存档

« 较老的文章

KDD 2010 – Accepted Papers

2010年05月2日，星期天

Research Full Presentations

# A Hierarchical Information Theoretic Technique for the Discovery of Non Linear Alternative Clusterings
Xuan Hong Dang*, The University of Melbourne; James Bailey, The University of Melbourne

# A Scalable Two-Stage Approach for a Class of Dimensionality Reduction Techniques
Liang Sun*, Arizona State University; Betul Ceran, Arizona State University; Jieping Ye, Arizona State University

# A Statistical Model for Popular Event Tracking in Social Communities
Xide Lin*, UIUC; Bo Zhao, U of Illinois,Urbana Champaign; Qiaozhu Mei, Univ. of Michigan; Jiawei Han,

# An Efficient Algorithm for a Class of Fused Lasso Problems
Jun Liu*, ASU; Lei Yuan, ; Jieping Ye, Arizona State University

# An efficient causal discovery algorithm for linear models
Zhenxing Wang*, The Chinese University of Hong; Laiwan Chan, The Chinese University of Hong Kong

# An Energy-Efficient Mobile Recommender System
Yong Ge*, Rutgers University; Hui Xiong, Rutgers University; Alexander Tuzhilin, Stern School of Business, New York University; Keli Xiao, Rutgers University; Marco Gruteser, Rutgers University

# Balanced Allocation with Succinct Representation
Saeed Alaei, University of Maryland; Ravi Kumar*, Yahoo; Azaraksh Malekian, malekian@cs.umd.edu; Erik Vee, Yahoo! Research

# Class-Specific Error Bounds for Ensemble Classifiers
Ryan Prenger*, Lawrence Livermore National La; Tracy Lemmond, Lawrence Livermore National Laboratory; Barry Chen, Lawrence Livermore National Laboratory; Kush Varshney, Massachusetts Institute of Technology; William Hanley, Lawrence Livermore National Laboratory

# Clustering by Synchronization
Christian Böhm*, University of Munich; Claudia Plant, Technische Universität München; Junming Shao, University of Munich; Qinli Yang, University of Edinburgh

# Collusion-Resistant Privacy-Preserving Data Mining
Bin Yang*, The University of Tokyo; Hiroshi Nakagawa, ; issei Sato, ; Jun Sakuma, University of Tsukuba

# Combined Regression and Ranking
D. Sculley*, Google, Inc

# Combining Predictions for Accurate Recommender Systems
Michael Jahrer*, Commendo research & consulting; Andreas Töscher, Commendo research & consulting; Robert Legenstein, Graz University of Technology

# Community Outliers and their Efficient Detection in Information Networks
Jing Gao*, UIUC; Feng Liang, UIUC; Wei Fan, IBM T.J.Watson; Chi Wang, UIUC; Yizhou Sun, University of Illinois at Urbana Champaign; Jiawei Han, UIUC

# Compressed Fisher Linear Discriminant Analysis: Classification of Randomly Projected Data
Robert Durrant*, University of Birmingham; Ata Kaban, University of Birmingham

# Connecting the Dots Between News Articles
Dafna Shahaf*, CMU; Carlos Guestrin, CMU

# Data Mining with Differential Privacy
Arik Friedman*, Technion; Assaf Schuster, Technion

# Designing efficient cascaded classifiers: Tradeoff between accuracy and cost
Vikas Raykar*, Siemens Healthcare; Balaji Krishnapuram, Siemens Healthcare; Shipeng Yu, Siemens Healthcare

# Discovering frequent patterns in sensitive data
Raghav Bhaskar, Microsoft Research; Srivatsan Laxman*, Microsoft Research; Adam Smith, Pennsylvania State University; Abhradeep Thakurta, Pennsylvania State University

# Discovering Significant Relaxed Order-Preserving Submatrices
Qiong FANG*, HKUST; Wilfred Ng, Hong Kong UST; Jianlin Feng, Sun Yat-sen University

# Discriminative Topic Modeling based on Manifold Learning
Seungil Huh*, Carnegie Mellon University; Stephen Fienberg,

# Document Clustering via Dirichlet Process Mixture Model with Feature Selection
Guan Yu, ; Ruizhang Huang*, The Hong Kong Polytechnic Univ; Zhaojun Wang,

# DUST: A Generalized Notion of Similarity between Uncertain Time Series
Smruti Sarangi, IBM Research – India; Karin Murthy*, IBM Research – India

# Estimating Rates of Rare Events with Multiple Hierarchies through Scalable Log-linear Models
Deepak Agarwal*, ; Nagaraj Kota, ; Rahul Agrawal, ; Rajiv Khanna,

# Evolutionary Hierarchical Dirichlet Processes for Multiple Correlated Time-varying Corpora
Jianwen Zhang*, Tsinghua University; Yangqiu Song, ; Changshui Zhang, Tsinghua University; Shixia Liu,

# Extracting Temporal Signatures for Comprehending Systems Biology Models
Naren Sundaravaradan, Virginia Tech; K. S. M. Tozammel Hossain, Virginia Tech; Vandana Sreedharan, Virginia Tech; John Paul Vergara, Ateneo de Manila University; Lenwood Heath, Virginia Tech; Douglas Slotta, NIH/NCBI; Naren Ramakrishnan*, Virginia Tech

# Fast Euclidean Minimum Spanning Tree: Algorithm, Analysis, Applications
William March*, Georgia Institute of Technolog; Parikshit Ram, Georgia Institute of Technology; Alexander Gray, Georgia Institute of Technology

# Fast Nearest Neighbor Search in Disk-resident Graphs
Purnamrita Sarkar*, CMU; Andrew Moore, Google

# Fast Online Learning through Effective Offline Initialization for Time-Sensitive Recommendation
Bee-Chung Chen*, Yahoo! Research; Deepak Agarwal, ; Pradheep Elango, Yahoo! Labs

# Fast Query Execution for Retrieval Models based on Path Constraint Random Walks
Ni Lao*, Carnegie Mellon University; William Cohen, Carnegie Mellon University

# Flexible Constrained Spectral Clustering
Xiang Wang*, UC Davis; Ian Davidson, UC Davis

# Frequent Regular Itemset Mining
Salvatore Ruggieri*, Università di Pisa

# GLS-SOD: A Generalized Local Statistical Approach for Spatial Outlier Detection
Feng Chen*, Virginia Tech; Chang-Tien Lu, Virginia Tech

# Grafting-Light: Fast, Incremental Feature Selection and Structure Learning of Markov Random Fields
Jun Zhu*, Carnegie Mellon University; Ni Lao, Carnegie Mellon University; Eric Xing, Carnegie Mellon Univresity

# Growing a tree in the forest: constructing folksonomies by integrating structured metadata
Anon Plangprasopchok*, Information Sciences Institute; Kristina Lerman, USC; Lise Getoor, University of Maryland, College Park

# Inferring Networks of Diffusion and Influence
Manuel Gomez Rodriguez*, Stanford University; Jure Leskovec, Stanford University; Andreas Krause, California Institute of Technology

# k-Support Anonymity based on Pseudo Taxonomy for Outsourcing of Frequent Itemset Mining
Chih-Hua Tai*, Ntu; Philip Yu, University of Illinois at Chicago; Ming-Syan Chen,

# Large Linear Classification When Data Cannot Fit In Memory
Hsiang-Fu Yu*, National Taiwan University; Cho-Jui Hsieh , ; Kai-Wei Chang, ; Chih-Jen Lin, National Taiwan University

# Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
Jianhui Chen*, Arizona State University; Ji Liu, Arizona State University; Jieping Ye, Arizona State University

# Learning to Combine Discriminative Classifiers
Chi-Hoon Lee*, Yahoo! Labs

# Learning with Cost Intervals
Xu-Ying Liu*, Nanjing University; Zhi-Hua Zhou, Nanjing University

# Mass Estimation and Its Applications
Kai Ming Ting*, Monash University; Guang-Tong Zhou, Shandong University; Fei Tony LIU, Monash University; James Tan, Monash University

# Mining Advisor-Advisee Relationships from Research Publication Networks
Chi Wang*, UIUC; Jiawei Han, ; Yuntao Jia, ; Jie Tang, Tsinghua; Duo Zhang, UIUC; Yintao Yu, UIUC; Jingyi Guo,

# Mining Positive and Negative Patterns for Relevance Feature Discovery
Yuefeng Li*, Queensland University of Techn; Abdulmohsen Algarni, ; Ning Zhong, Maebashi Institute of Technology, Japan

# Mining Program Workflow from Interleaved Traces
Jian-Guang LOU*, Microsoft Research Asia; Qiang FU, Microsoft Research Asia; Shengqi YANG, Beijing Univ. of Posts and Telecom; Jiang LI, Microsoft Research Asia; Bin WU, Beijing Univ. of Posts and Telecom

# Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows
Hoang Thanh Lam*, TU Eindhoven; Toon Calders, technische Universiteit Eindhoven

# Mining Uncertain Data with Probabilistic Guarantees
Liwen Sun*, University of Hong Kong; Reynold Cheng, University of Hong Kong; David Cheung, University of Hong Kong; Jiefeng Cheng,

# Modeling Relational Events via Latent Classes
Christopher DuBois*, UC Irvine; Padhraic Smyth,

# Multi-Label Learning by Exploiting Label Dependency
Min-Ling Zhang*, Hohai University; Kun Zhang, MPI for Biological Cybernetics

# Multi-Task Learning for Boosting with Application to Web Search Ranking
Olivier Chapelle*, Yahoo! Research; Srinivas Vadrevu, Yahoo! Labd; Kilian Weinberger, Washington University in St. Louis; Pannagadatta Shivaswamy, Columbia University; Ya Zhang, Shanghai Jiaotong University; Belle Tseng, Yahoo! Labs

# Negative correlations in collaboration: concepts and algorithms
Jinyan Li*, Nanyang Technological University, Singapore; Qian Liu, NTU; Tao Zeng, NTU

# Neighbor Query Friendly Compression of Social Networks
Hossein Maserrat*, Simon Fraser University; Jian Pei, SFU

# Nonnegative Shared Subspace Learning and Its Application to Social Media Retrieval
Sunil Gupta*, Curtin University; Dinh Phung, Curtin University; Brett Adams, Curtin University; Truyen Tran, Curtin University; Svetha Venkatesh, Curtin University

# On the Quality of Inferring Interests From Social Neighbors
Zhen Wen*, IBM T.J. Watson Research; Ching-Yung Lin, IBM T.J. Watson Research Center

# Online Discovery and Maintenance of Time Series Motifs
Abdullah Mueen*, UC Riverside; Eamonn Keogh, UC Riverside

# Online Multiscale Dynamic Topic Models
Tomoharu Iwata*, ; Takeshi Yamada, NTT; Yasushi Sakurai, NTT; Naonori Ueda, NTT

# Oracle Classification – Learning What Really Matters
Ulf Johansson*, University of Boras; Cecilia Sönströd, ; Tuve Löfström,

# Privacy-Preserving Outsourcing Support Vector Machines with Random Transformation
Ming-Syan Chen*, ; Keng-Pei Lin, National Taiwan University

# Redefining Class Definitions using Constraint-Based Clustering
Dan Preston*, Tufts University; Carla Brodley, Tufts University; Roni Khardon, Tufts University; Damien Sulla-Menashe, Boston University; Mark Friedl, Boston University

# Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks
Wei Chen, ; Chi Wang, UIUC; Yajun Wang*,

# Scalable Similarity Search with Optimized Kernel Hashing
Junfeng He*, Columbia University; Wei Liu, Columbia University; Shih-Fu Chang, Columbia University

# Semi-Supervised and Sparse Metric Learning Using Alternating Direction Optimization
Wei Liu*, CUHK; Shiqian Ma, ; Dacheng Tao, Nanyang Technological University; Jianzhuang Liu,

# Semi-supervised Feature Selection for Graph Classification
Xiangnan Kong, University of Illinois; Philip Yu*, University of Illinois at Chicago

# Suggesting Friends Using the Implicit Social Graph
Maayan Roth*, Google; Assaf Ben-David, Google; David Deutscher, Google, Inc; Ilan Horn, Google, Inc; Aril Leichtberg, Google; Naty Leiser, Google; Ron Merom, Google; Yossi Mattias, Google, Inc

# The community-search problem and how to plan a successful cocktail party
Mauro Sozio, Max-Planck-Institut fur Informatik; Aristides Gionis*, Yahoo! Research Barcelona

# The new Iris Data: Modular Data Generators
Iris Adae*, Universitaet Konstanz; Michael Berthold, University of Konstanz

# The Topic-Perspective Model for Social Tagging Systems
Caimei Lu*, Drexel University; Xiaohua Hu, Drexel University; Xin Chen, Drexel University; Jung-ran Park, Drexel University

# Topic Dynamics: an alternative model of `Bursts’ in Streams of Topics
Dan He*, UCLA; Douglass Parker, UCLA Computer Science Dept

# Topic Models with Power-Law Using Pitman-Yor Process
Issei Sato*, University of Tokyo; Hiroshi Nakagawa, University of Tokyo

# Training and Testing of Recommender Systems on Data Missing Not at Random
Harald Steck*, Bell Labs, Alcatel-Lucent

# Trust Network Inference for Online Rating Data Using Generative Models
Freddy Chong Tat Chua*, Singapore Management Universit; Ee-Peng Lim, Singapore Management University

# Unifying Dependent Clustering and Disparate Clustering for Non-homogeneous Data
M. Shahriar Hossain, Virginia Tech; Satish Tadepalli, Virginia Tech; Layne Watson, Virginia Tech; Ian Davidson, UC Davis; Richard Helm, Virginia Tech; Naren Ramakrishnan*, Virginia Tech

# Unsupervised Feature Selection for Multi-Cluster Data
Deng Cai*, Zhejiang University; Chiyuan Zhang, Zhejiang University; Xiaofei He, Zhejiang University

# Unsupervised Transfer Learning: Application to Text Categorization
Tianbao Yang*, Michigan State University; Rong Jin, Michigan State University; Anil Jain, Michigan State University; Yang Zhou, Michigan State University; Wei Tong, Michigan State University

# UP-Growth: An Efficient Algorithm for High Utility Itemsets Mining
Vincent Tseng*, National Cheng Kung University; Cheng Wei Wu, National Cheng Kung University; Bai-En Shie, National Cheng Kung University; Philip Yu, University of Illinois at Chicago

# User Browsing Models: Relevance versus Examination
Ramakrishnan Srikant*, Google Research; Sugato Basu, Google Research; Ni Wang, ; Daryl Pregibon, “Google, USA”

# Versatile Publishing for Privacy Preservation
Xin Jin*, George Washington University; Mingyang Zhang, George Washington University; Nan Zhang, George Washington University; Gautum Das, UT Arlington

# Why label when you can search? Strategies for applying human resources to build classification models under extreme class imbalance.
Josh Attenberg*, NYU Polytechnic Institute; Foster Provost, NYU

Research Short Presentations

# A POWER Framework for Multi-Class Membership in Bayesian Mixture Models
Manas Somaiya*, University of Florida; Christopher Jermaine, Rice University; Sanjay Ranka, University of Florida

# A Probabilistic Model for Personalized Tag Prediction
Dawei Yin*, Lehigh University; Zhenzhen Xue, Lehigh University; Liangjie Hong, Lehigh University; Brian Davison, Lehigh University

# A Unified Algorithmic Framework for Multi-Dimensional Scaling
Arvind Agarwal, University of Utah; Jeff Phillips*, University of Utah; Suresh Venkatasubramanian, University of Utah

# BioSnowball: Automated Population of Wikis
Xiaojiang Liu, ; Zaiqing Nie*, Microsoft; Nenghai Yu, ; Ji-Rong Wen, Microsoft Research Asia

# Boosting with Structure Information in the Functional Space: an Application to Graph Classification
Hongliang Fei*, University of Kansas; Jun Huan, University of Kansas

# Cold Start Link Prediction
Vincent Leroy, IRISA; Berkant Cambazoglu, Yahoo! Research; Francesco Bonchi*, Yahoo! Research

# Community-based Greedy Algorithm for Mining Top-K Influential Nodes in Mobile Social Networks
Yu Wang*, PKU; Gao Cong, Nanyang Techonological University; Guojie Song, Peking University; Kunqing Xie, Peking University

# Direct Mining of Discriminative Patterns for Classifying Uncertain Data
Chuancong Gao*, Tsinghua University; Jianyong Wang, Tsinghua University

# Discovering Probabilistic Frequent Subgraphs over Uncertain Graph Databases
Zhaonian Zou*, Harbin Institute of Technology; Jianzhong Li, Harbin Institute of Technology; Hong Gao, Harbin Institute of Technology

# DivRank: the Interplay of Prestige and Diversity in Information Networks
Qiaozhu Mei*, Univ. of Michigan; Jian Guo, University of Michigan; Dragomir Radev, University of Michigan

# Dynamics of Conversations
Ravi Kumar, Yahoo; Mohammad Mahdian, Yahoo! Research; Mary McGlohon*,

# Ensemble Pruning via Individual Contribution Ordering
Zhenyu Lu*, University of Vermont; Xindong Wu, University of Vermont; Josh Bongard, University of Vermont

# Feature Selection for Support Vector Regression Using Probabilistic Prediction
Chong-Jin Ong*, National University Singapore; Jianbo Yang, National University Singapore

# Finding Effectors in Social Networks
Theodoros Lappas*, UCR; Heikki Mannila, ; Evimaria Terzi, Boston University; Dimitrios Gunopulos, UoA

# Generative Models for Ticket Resolution in Expert Networks
Gengxin Miao*, UC at Santa Barbara; Louise Moser, UC at Santa Barbara; Xifeng Yan, University of California at Santa Barbara; Shu Tao, IBM T. J. Watson; Yi Chen, Arizona State Univ.; Nikos Anerousis, IBM T. J. Watson

# Latent Aspect Rating Analysis on Review Text Data: A Rating Regression Approach
Hongning Wang*, University of Illinois; Yue Lu, University of Illinois; ChengXiang Zhai, UIUC

# New Perspectives and Methods in Link Prediction
Ryan Lichtenwalter*, The University of Notre Dame; Jake Lussier, The University of Notre Dame; Nitesh Chawla, The University of Notre Dame

# Parallel SimRank Computation on Large Graphs with Iterative Aggregation
Guoming He, Renmin University of China; Haijun Feng, ; Cuiping Li*, Renmin University of China; Hong Chen,

# Probably the Best Itemsets
Nikolaj Tatti*, University of Antwerp

# Semantic Relation Extraction With Kernels Over Typed Dependency Trees
Frank Reichartz*, Fraunhofer IAIS; hannes Korte, Fraunhofer IAIS; Gerd Paass,

# Social Action Tracking via Noise Tolerant Time-varying Factor Graphs
Chenhao Tan, Tsinghua University; Jie Tang*, Tsinghua; Jimeng Sun, IBM; Quan Lin, Huazhong University of Science and Technology; Fengjiao Wang, BeiJing University of Aeronautics & Astronautics

# Temporal Recommendation on Graphs via Long- and Short-term Preference Fusion
Liang Xiang, Institute of Automation, Chinese Academy of Sciences; Quan Yuan*, IBM Research – China; Shiwan Zhao, IBM Research – China; Li Chen, Department of Computer Science, Hong Kong Baptist University; Xiatian Zhang, IBM Research – China; Jimeng Sun, IBM

# Towards Mobility-based Clustering
Siyuan Liu*, HKUST; Yunhuai Liu, ; Lionel Ni, ; Jianping Fan, ; Minglu Li,

# Transfer Metric Learning by Learning Task Relationships
Yu Zhang*, HKUST; Dit-Yan Yeung, Hong Kong University of Science and Technology

818 次访问

发布在 研究 | 17 条评论 »

IPv6现状

2010年04月28日，星期三

http://www.deepspace6.net/docs/ipv6_status_page_apps.html 给出了目前支持IPv6协议的各个层次的应用程序。

最后更新时间是2010年3月9号

55 次访问

标签：
发布在 研究 | 没有评论 »

[Tccc] Cfp: CSCN2010 – Aug 15 2010 – Beijing, China

2010年04月22日，星期四

The First Workshop on Compressive Sensing for Communications and Networking
Aug 15, 2010, Beijing, China

http://students.uta.edu/jx/jxl5466/cscn-wasa10.htm

Call for Papers
———————————————-
Compressive Sensing (CS), also known as compressive sampling, is a novel
sensing/sampling paradigm
that goes against the common wisdom in data acquisition. CS theory asserts
that one can recover certain
signals and images from far fewer samples or measurements than traditional
methods. The crucial
observation is that one can design efficient sensing or sampling protocols
that capture the useful
information content embedded in a sparse signal and condense it into a small
amount of data. The goal of
this workshop is to disseminate the most recent results in the development
of CS in communications and
networks. Researchers and practitioners working in this area are expected to
take this opportunity to discuss
and express their views on the current trends, challenges, and state of the
art solutions addressing various
issues in CS for communications and networks. Review papers on CS are also
welcome. Topics to be
covered in this workshop include but are not limited to:
* CS for sensor networks
* CS for wireless communications
* CS for channel equalization
* CS for joint source and channel coding
* CS for MIMO systems
* CS for wireless mesh networks
* CS for cellular systems
* CS for channel modeling
* Information theory of CS
* CS for network traffic
* CS for multimedia traffic
* CS for ultra-wideband systems
* CS for remote sensing applications
* CS for nonadaptive signal compression or streaming dataset reduction
* CS for Internet
* CS in multimedia communications
* CS for wired communications and networks
* CS for spread spectrum
* CS for interference cancelation
* CS for co-existence of wireless systems
* CS methods that are tolerant to noise, signal nonsparsity, or measurement
nonlinearity in
communications
* hardware implementation of CS systems
* Other applications

Submission:
Sunday, May 16, 2010
Notification:
Tuesday, June 1, 2010
Camera ready:
Tuesday, June 15, 2010

General Chair:
Prof. Jing Liang, University of Texas at Arlington, USA
E-mail: jliang@wcn.uta.edu
TPC Chairs:
Prof. Dechang Chen, Uniformed Services University of the Health Sciences,
USA
Email: dchen@usuhs.mil
Prof. Qilian Liang, University of Texas at Arlington, USA
E-mail: liang@uta.edu
Program Committee:
Dr. Xiuzhen Cheng, George Washington University
Dr. Ting Jiang, Beijing University of Posts and Telecommunications, China
Dr. Qingchun Ren, Microsoft, Seattle, USA
Dr. Sherwood W. Samn, Air Force Research Laboratory/RHX, San Antonio, TX
78235, USA
Dr. Lingming Wang, iBiquity Digital Corporation, Basking Ridge, NJ 07920 USA
Dr. Xinsheng Xia, Tellabs Inc, New Jersey, USA
Dr. Liang Zhao, Airvana Inc, Chelmsford, MA
Dr. Zheng Zhou, Beijing University of Posts and Telecommunications, China

88 次访问

标签：
发布在 研究 | 没有评论 »

Belief propagation

2010年04月22日，星期四

http://blog.sina.com.cn/s/blog_60a751620100eiq8.html

(zz from Dahua’s blog)

Belief propagation是machine learning的泰斗J. Pearl的最重要的贡献。对于统计学来说，它最重要的意义就是在于提出了一种很有效的求解条件边缘概率(conditional marginal probability)的方法。说的有点晦涩了，其实所谓求解条件边缘概率，通俗地说，就是已知某些条件的情况下，推导另外某些事件发生的概率。

如果涉及的因素只有那么几个，一个学过概率论的大学生就可以使用简单的概率公式计算出来。可是，在现实世界中有成千上万的因素，它们相互联系，如果按照传统方法，就要对数以千计的变量进行积分。考虑到运算量对于变量个数以指数增长，因此这么做实际上根本没法算的。虽然，后来人们提出了蒙特卡罗(Monte Carlo)积分，但是对于拥有数以千计变量的复杂系统，仍然可以说是computationally prohibitive。
这个困难一直阻碍着统计推断方法在大规模系统中的应用。Belief propagation出来之后，情况才发生了转变。J. Pearl在他的书中分析说，人们在头脑中经常进行各种各样的推断，可是人在头脑里面发生了什么事情呢：穷举所有未知变量的可能状态进行积分(Traditional method)？还是随即产生各种状态求均值(Monte Carlo Integral)，看来都不make sense。J. Pearl认为，虽然影响世界的因素繁多，但是每个因素实际上只与少数几个因素相关，这就构成了一个推断网络。在machine learning里面，这样的网络有两种：Bayesian Network，反映的是因果推断关系（就是说，相互联系的因素中，其中一个是因，另外一个是果），以及Markov Network，反映的是相互影响的关系（两个因素互为因果，其变化相互影响）。根据这种建模方式，J.Pearl提出把inference局部化和分布化，把全局的积分变成局部的消息传递。网络中的每个节点通过和邻近节点交换信息对自身的概率状况进行评估。通过这种方式，使得计算量从指数增长变成近似的线性增长，从而使得统计推断能在复杂系统中被应用。
数学上可以证明，对于有向无环的Bayesian Network，可以证明，通过BP得到的解和严格的积分计算得到的结果是一致的。这时的BP只是利用因素联系的局部性来简化计算，并把计算过程分散到各个节点。对于无向而且到处是环的markov network，J.Pearl指出，这种传播过程是可能导致不稳定的。某些消息可能在环状的传播过程中无限加强，从而导致整个系统发散或者偏离。但是实际经验表明，对于大部分问题，BP在带环的系统中依然工作良好。很多人对这个现象进行了研究，对于某些特例给出了初步的解释，但是关于Loopy BP的稳定性和收敛性问题，离理论上的最终解决，还有很长的路要走。
在computer vision领域，MIT的著名教授W.T. Freeman是BP方法的积极倡导者，他大量使用markov random field和belief propagation对图像进行建模，在很多应用领域取得了不错的结果。
其实关于Local propagation的方法论，现在有超出了belief propagation的范畴。某些新的方法的优化流程也体现了类似的特征。我在我自己最近一项关于应用信息论进行监督学习的工作中发现，如果使用信息论最大化引导分类过程，事实上其优化流程就体现了样本间的局部交互和传播。不仅仅是机器学习，物理学也同样如此，比如当一个粒子发生了运动，其效应也是不断通过与邻近粒子的相互作用向外扩散，从而形成波动过程。一直以来，machine learning的formulation都是对问题从宏观着眼，可是最近一些工作都在暗示着微观作用过程对于宏观状态形成的重要意义。因此，一些新的研究开始偏向对局部结构和微观作用的考察，得到了一些有趣的发现。Manifold Learning中的一些重要方法，比如Local Linearly Embedding就是其中重要的代表。
72 次访问

发布在 研究 | 没有评论 »

攻坚战！

2010年04月21日，星期三

从现在开始到这周日，事关存亡！

48 次访问

发布在 研究 | 没有评论 »

www 2010会议议程

2010年04月21日，星期三

www会议是网络界的一个大会，偏向于应用方向，从中可以了解一下网络的发展情况，今年的会议议程见：http://www2010.org/www/program/papers/

Wednesday, 2:00 – 3:30 PM

Classification-Enhanced Ranking
Paul N. Bennett, Krysta Svore, Susan Dumais

Ranking Specialization for Web Search: A Divide-and-Conquer Approach by
Using Topical RankSVM
Jiang Bian, Xin Li, Fan Li, Zhaohui Zheng, Hongyuan Zha

Generalized Distances between Rankings
Ravi Kumar, Sergei Vassilvitskii

Predicting Positive and Negative Links in Online Social Networks
Jure Leskovec, Daniel Huttenlocher, Jon Kleinberg

Empirical Comparison of Algorithms for Network Community Detection
Jure Leskovec, Kevin Lang, Michael Mahoney

Modeling Relationship Strength in Online Social Network
Rongjing Xiang, Jennifer Neville, Monica Rogati

Collaborative Location and Activity Recommendations with GPS History Data
Vincent W. Zheng, Yu Zheng, Xing Xie, Qiang Yang

Find Me If You Can: Improving Geographical Prediction with Social and Spatial Proximity
Cameron Marlow, Lars Backstrom, Eric Sun

Equip Tourists with Knowledge Mined from Travelogues
Qiang Hao, Rui Cai, Changhu Wang, Lei  Zhang

Wednesday, 4:00 – 5:30 PM

Beyond Position Bias: Examining Result Attractiveness as a Source of
Presentation Bias in Clickthrough Data
Yisong Yue, Hein Roehrig, Rajan Patel

Use Twitter Data for Recency Ranking Improvement in Web Search
Anlei Dong, Ruiqiang Zhang, Pranam Kolari, Bai Jing, Yi Chang, Fernando Diaz, Zhaohui Zheng, Hongyuan Zha

Visualizing Differences in Web Search Algorithms using the Expected Weighted Hoeffding Distance
Mingxuan Sun. Guy Lebanon, Kevyn Collins-Thompson

Randomization Tests for Distinguishing Social Influence and Homophily Effects
Jennifer Neville, Timothy La Fond

Exploiting Social Context for Review Quality Prediction
Yue Lu, Panayiotis Tsaparas, Alex  Ntoulas, Livia  Polanyi

Context-aware Citation Recommendation
Qi He, Jian Pei, Daniel Kifer, Prasenjit Mitra, C. Lee Giles

Cross-Domain Sentiment Classification via Spectral Feature Alignment
Sinno Pan, Xiaochuan Ni, Jiantao Sun, Qiang Yang, Zheng Chen

Highlighting Disputed Claims on the Web
Rob Ennals, Beth Trushkowsky, John Mark Agosta, Tye Rattenbury, Tad Hirsch

Topic Initiator Detection on the World Wide Web
Xin Jin, Scott Spangler, Rui Ma, Jiawei Han

Distributing Private Data in Challenged Network Environments
Azarias Reda, Brian Noble, Yidnekachew Haile

Privacy Wizards for Social Networking Sites
Lujun Fang, Kristen LeFevre

Reigning in the Web with Content Security Policy
Sid Stamm, Brandon Sterne, Gervase Markham

Expressive Auctions for Externalities in Online Advertising
Arpita Ghosh, Amin Sayedi

AdHeat: An Influence-based Diffusion Model for Propagating Hints to Match Ads
Hongji Bao, Ed Chang

Using Landing Pages for Sponsored Search Ad Selection
Yejin Choi, Marcus Fontoura, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang, Mauricio Mediano

Thursday, 10:30 AM – 12:00 PM

Selecting Skyline Services for QoS-based Web Service Composition
Mohammad Alrifai, Dimitrios Skoutas, Thomas Risse

Automated Performance Assessment for Service-Oriented Middleware
Domenico Bianculli, Walter Binder, Mauro Luigi Drago

Autonomous Resource Provisioning for Multi-Service Web Applications
Dejun Jiang, Guillaume Pierre, Chihung Chi

Statistical Models of Music-listening Sessions in Social Media
Elena Zheleva, John Guiver, Eduarda Mendes Rodrigues, Natasa Milic-Frayling

Unlocking the Semantics of Multimedia Presentations in the Web with the
Multimedia Metadata Ontology
Carsten Saathoff, Ansgar  Scherp

What are the most eye-catching and ear-catching features in the video?
Implications for Video Summarization
Yaxiao Song, Gary Marchionini, Chi Young Oh

Actively Predicting Diverse Search Intent from User Browsing Behaviors
Zhicong Cheng, Bin Gao, Tie-Yan Liu

Exploiting Query Reformulations for Web Search Result Diversification
Rodrygo Santos, Craig Macdonald, Iadh  Ounis

Diversifying Web Search Results
Davood Rafiei, Krishna Bharat, Anand Shukla

b-Bit Minwise Hashing
Ping Li, Christian Konig

Max-Cover in Map-Reduce
Flavio Chierichetti, Ravi Kumar, Andrew Tomkins

Distributed Nonnegative Matrix Factorization for Web-Scale Dyadic
Data Analysis on MapRedduce
Chao Liu, Hung-chih Yang, Jinliang Fan, Li-Wei He, Yi-Min Wang

Thursday, 1:30 – 3:00 PM

LCA-based Selection for XML Document Collections
Georgia Koloniari, Evaggelia Pitoura

Faceted Exploration of Image Search Results
Roelof van Zwol, Börkur Sigurbjörnsson

Matrix “Bit”loaded: A scalable lightweight join query processor for RDF data
Medha Atre, Vineet Chaoji, Mohammed Zaki, James Hendler

Money, Glory and Cheap Talk: Analyzing Strategic Behavior of Contestants in Simultaneous
Crowdsourcing Contests on TopCoder.com
Nikolay Archak

Factorizing Personalized Markov Chains for Next-Basket Recommendation
Steffen Rendle, Christoph Freudenthaler, Lars Schmidt-Thieme

A Contextual Bandit Approach to Personalized News Article Recommendation
Lihong Li, Wei Chu, John Langford, Robert Schapire

Object Views: Fine-Grained Sharing in Browsers
Leo Meyerovich, Adrienne Felt

Dynamic and Graphical Web Page Breakpoints
John Barton, Jan Odvarko

Automated Object Persistence for JavaScript
Brett Cannon, Eric Wohlstadter

Relational Duality: Unsupervised Extraction of Semantic Relations between Entities on the Web
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuka, Nguyen Duc

Automatic Extraction of Clickable Structured Web Contents for Name Entity Queries
Xiaoxin Yin, Wenzhao Tan, Xiao Li, Yi-Chin Tu

A Scalable Machine Learning Approach for Semi-Structured Named Entity Recognition
Utku Irmak, Reiner Kraft

Stochastic Models for Tabbed Browsing
Flavio Chierichetti, Ravi Kumar, Andrew Tomkins

A Characterization of Online Search Behavior
Ravi Kumar, Andrew Tomkins

Tracking the random surfer: Empirically measured teleportation parameters in PageRank
David Gleich, Paul Constantine, Abraham Flaxman, Asela Gunawardana

Thursday, 3:30 – 5:00 PM

Fine-Grained Privilege Separation for Web Applications
Akshay Krishnamurthy, Adrian Mettler, David Wagner

Malicious Interface Design:  Exploiting the User
Gregory Conti, Edward Sobiesk

Detection and Analysis of Drive-by-Download Attacks and Malicious JavaScript Code
Marco Cova, Christopher Kruegel, Giovanni Vigna

Scalable Techniques for Document Identifier Assignment in Inverted Indexes
Shuai Ding, Josh Attenberg, Torsten Suel

Sync Kit: A Persistent Client-Side Database Caching Toolkit for Data Intensive Websites
Edward Benson, Adam Marcus, David Karger, Samuel Madden

A Refreshing Perspective of Search Engine Caching
Flavio Junqueira, Berkant Barla Cambazoglu, Vassilis Plachouras, Swee Lim, Baoqiu Cui, Scott Banachowski

A Comparison of Visual and Textual Page Previews in Judging the Helpfulness of Web Pages
Anne Aula, Rehan Khan, Peter Hong, Zhiwei Guan, Paul Fontes

The “Map Trap”? An evaluation of map versus text-based interfaces for location-based
mobile search services
Karen Church, Joachim Neumann, Mauro Cherubini, Nuria Oliver

Sketcha: A Captcha Based on Line Drawings of 3D Models
Adam Finkelstein, Steven Ross, Alex Halderman

Liquid Query: Multi-domain Exploratory Search on the Web
Marco Brambilla, Alessandro Bozzon, Stefano Ceri, Piero Fraternali

Atomate It! End-user context-sensitive automation using heterogeneous information
sources on the Web
Max Van Kleek, Brennan Moore, Paul André, David Karger, mc schraefel

A Novel Traffic Analysis for Identifying Search Fields in the Long Tail of Web Sites
George Forman, Evan Kirshenbaum, Shyamsundar Rajaram

SESSION: INTERNET MONETIZATION 2

Competing for Users’ Attention: On the Interplay between Organic and Sponsored Search Results
Cristian Danescu-Niculescu-Mizil, Andrei Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

Mining Advertiser-specific User Behavior Using Adfactors
Nikolay Archak, Vahab Mirrokni, S Muthukrishnan

The Anatomy of an Ad: Structured Indexing and Retrieval for Sponsored Search
Michael Bendersky, Evgeniy Gabrilovich, Vanja Josifovski, Donald  Metzler

Friday, 10:30 AM – 12:00 PM

Regular Expressions Considered Harmful in Client-Side XSS Filters
Daniel Bates, Adam Barth, Collin Jackson

The Anatomy of a Large-Scale Social Search Engine
Damon Horowitz, Sepandar Kamvar

DSNotify: Handling Broken Links in the Web of Data
Niko Popitsch, Bernhard Haslhofer

Sampling Community Structure
Arun Maiya, Tanya Berger-Wolf

Using a Model of Social Dynamics to Predict Popularity of News
Kristina Lerman, Tad Hogg

On the Feasibility of Social Network Experimentation using Measurement-calibrated Graph Models
Alessandra Sala, Lili Cao, Christo Wilson, Robert Zablit, Haitao Zheng, Ben Zhao

SESSION: QUERY ANALYSIS 1

Exploring Web Scale Language Models for Search Query Processing
Jian Huang, Jiangbo Miao, Xiaolong Li, Jianfeng Gao, Kuansan Wang

Building Taxonomy of Web Search Intents for Name Entity Queries
Xiaoxin Yin, Sarthak Shah

Optimal Rare Query Suggestion With Implicit User Feedback
Yang Song, Li-wei He

Friday, 1:30 – 3:00 PM

SESSION: INFRASTRUCTURE 2

A Pattern Tree-based Approach to Learning URL Normalization Rules
Rui Cai, Lei Zhang

0-Cost Semisupervised Bot Detection for Search Engines
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Behr, Zijian Zheng

CETR – Content Extraction via Tag Ratios
Tim Weninger, William Hsu, Jiawei Han

Inferring Relevant Social Networks from Interpersonal Communication
Munmun De Choudhury, Winter Mason, Jake Hofman, Duncan Watts

What is Twitter, a Social Network or a News Media?
Haewoon Kwak, Changhyun Lee, Hosung Park, Sue Moon

Earthquake Shakes Twitter Users: Real-time Event Detection by Social Sensors
Takeshi Sakaki, Makoto Okazaki, Yutaka Matsuo

Towards Natural Question Guided Search
Alexander Kotov, ChengXiang Zhai

A General Framework for Exploring Category Information for Question Retrieval in
Community Question Answer Archives
Xin Cao, Gao Cong, Bin Cui, Christian Jensen

Clustering Query Refinements by User Intent
Eldar Sadikov, Jayant Madhavan, Lu Wang, Alon Halevy

Multi-modality in One-class Classification
Boris Chidlovskii, Matthijs Hovelynck

A Large Scale Active Learning System for Topical Categorization on the Web
Suju Rajan, Dragomir Yankov, Scott Gaffney, Adwait Ratnaparkhi

The Paths More Taken: Matching DOM Trees to Search Logs for Accurate Webpage Clustering
Deepayan Chakrabarti, Rupesh Mehta

Do you want to take notes?  Identifying research missions in Yahoo! Search Pad
Debora Donato, Francesco Bonchi, Tom Chi, Yoelle Maarek

How useful are your comments? Analyzing and Predicting YouTube Comments and Comment Ratings
Stefan Siersdorfer, Jose San Pedro, Sergiu Chelaru, Wolfgang Nejdl

Stop Thinking, Start Tagging: Tag Semantics Arise From Collaborative Verbosity
Christian Körner, Dominik Benz, Markus Strohmaier, Andreas Hotho, Gerd Stumme

Friday, 3:30 – 5:00 PM

Redundancy Detection in Service-Oriented Systems
Peep Küngas, Marlon Dumas

Protocol-Aware Matching of Web Service Interfaces for Adapter Development
Hamid Motahari, GuangYuan Xu, Boualem Benatallah

Volunteer Computing: A Model of the Factors Determining Contribution to
Community-Based Scientific Research
Oded Nov, David Anderson, Ofer Arazy

Facetedpedia: Dynamic Generation of Query-Dependent Faceted Interfaces for Wikipedia
Chengkai Li, Ning Yan, Senjuti  Roy, Lekhendro Lisham, Gautam Das

Ad-Hoc Object Retrieval in the Web of Data
Jeffrey Pound, Peter Mika, Hugo Zaragoza

Towards Rich Query Interpretation: Back and Forth on Query Template Mining
Govind Kabra, Kevin Chang, Ganesh Agarwal

Smart Caching for Web Browsers
Zhang Kaimin, Wang Lu, Pan Aimin, Zhu Bin

Fast and Parallel Webpage Layout
Leo Meyerovich, Ras Bodik

Alhambra: A System for Creating, Enforcing and Testing Browser Security Policies
Shuo Tang, Chris Grier, Onur Aciicmez, Sam King

Mind the Data Skew: Distributed Inferencing by Speeddating in Elastic Regions
Spyros Kotoulas, Eyal Oren, Frank van Harmelen

Data Summaries for On-demand Queries over Linked Data
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel Polleres, Kai-Uwe Sattler, Jüregen Umbrich

Identification and Disambiguation of Graph-structured Concepts for Enterprise Search
Falk Brauer, Michael Huber, Gregor Hackenbroich, Ulf Leser, Felix Naumann, Wojciech Barczyński

Monitoring Algorithms for Negative Feedback Systems
Mark Sandler, S Muthukrishnan

Document Recommendation in Social Tagging Services
Ziyu Guan, Can Wang, Kun Yang, Jiajun Bu, Chun Chen, Deng Cai

Measurement and Analysis of an Online Content Voting Network:
A Case Study of Digg
Yingwu Zhu

137 次访问

标签：
发布在 研究 | 没有评论 »

几个基本概念

2010年04月18日，星期天

db

dbm

功率

电平

传输损耗等，

见：http://wenku.baidu.com/view/163648fb770bf78a65295417.html

59 次访问

发布在 研究 | 没有评论 »

opnet仿真

2010年04月18日，星期天

今后将陆续推出自己学习opnet的过程、经验和体会。

47 次访问

标签：
发布在 OPNET仿真 | 没有评论 »

blackhat 2010

2010年04月16日，星期五

官方网站http://blackhat.com/html/bh-eu-10/

一些议题的资料：http://blog.c22.cc/

看黑帽的东西比起看那些学术论文要爽得多了。

有时间要翻译点评一下这些充满生命力的文章。

61 次访问

发布在 研究 | 没有评论 »

ICCASP会议

2010年04月14日，星期三

似乎是信号处理方向比较好的会议，要多关注关注

52 次访问

发布在 研究 | 没有评论 »

« 较老的文章