Most Influential WWW Papers (2023-09)
The Web Conference (WWW) is one of the top internet conferences in the world. Paper Digest Team analyzes all papers published on WWW in the past years, and presents the 15 most influential papers for each year. This ranking list is automatically constructed based upon citations from both research papers and granted patents, and will be frequently updated to reflect the most recent changes. To find the latest version of this list or the most influential papers from other conferences/journals, please visit Best Paper Digest page. Note: the most influential papers may or may not include the papers that won the best paper awards. (Version: 2023-09)
To search or review papers within WWW related to a specific topic, please use the search by venue (WWW) and review by venue (WWW) services. To browse the most productive WWW authors by year ranked by #papers accepted, here is a list of most productive WWW authors.
Based in New York, Paper Digest is dedicated to producing high-quality text analysis results that people can acturally use on a daily basis. Since 2018, we have been serving users across the world with a number of exclusive services to track, search, review and rewrite scientific literature.
You are welcome to follow us on Twitter and Linkedin to get updated with new conference digests.
Paper Digest Team
New York City, New York, 10017
team@paperdigest.org
TABLE 1: Most Influential WWW Papers (2023-09)
Year | Rank | Paper | Author(s) |
---|---|---|---|
2023 | 1 | Learning Vector-Quantized Item Representation for Transferable Sequential Recommenders IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Despite the promising transferability, the binding between item text and item representations might be too tight, leading to potential problems such as over-emphasizing the effect of text features and exaggerating the negative impact of domain gap. To address this issue, this paper proposes VQ-Rec, a novel approach to learning Vector-Quantized item representations for transferable sequential Recommenders. |
Yupeng Hou; Zhankui He; Julian McAuley; Wayne Xin Zhao; |
2023 | 2 | Bootstrap Latent Representations for Multi-modal Recommendation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Moreover, existing multi-modal recommendation methods usually leverage randomly sampled negative examples in Bayesian Personalized Ranking (BPR) loss to guide the learning of user/item representations, which increases the computational cost on large graphs and may also bring noisy supervision signals into the training process. To tackle the above issues, we propose a novel self-supervised multi-modal recommendation model, dubbed BM3, which requires neither augmentations from auxiliary graphs nor negative samples. |
XIN ZHOU et. al. |
2023 | 3 | Multi-Modal Self-Supervised Learning for Recommendation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To this end, we propose a new Multi-Modal Self-Supervised Learning (MMSSL) method which tackles two key challenges. |
Wei Wei; Chao Huang; Lianghao Xia; Chuxu Zhang; |
2023 | 4 | Do Language Models Plagiarize? IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: For instance, models can generate paraphrased sentences that are contextually similar to training samples. In this work, therefore, we study three types of plagiarism (i.e., verbatim, paraphrase, and idea) among GPT-2 generated texts, in comparison to its training data, and further analyze the plagiarism patterns of fine-tuned LMs with domain-specific corpora which are extensively used in practice. |
Jooyoung Lee; Thai Le; Jinghui Chen; Dongwon Lee; |
2023 | 5 | On How Zero-Knowledge Proof Blockchain Mixers Improve, and Worsen User Privacy IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We find that ZKP mixers are tightly intertwined with the growing number of Decentralized Finance (DeFi) attacks and Blockchain Extractable Value (BEV) extractions. |
ZHIPENG WANG et. al. |
2023 | 6 | GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose GraphPrompt, a novel pre-training and prompting framework on graphs. |
Zemin Liu; Xingtong Yu; Yuan Fang; Xinming Zhang; |
2023 | 7 | PROD: Progressive Distillation for Dense Retrieval IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To bridge the gap, we propose PROD, a PROgressive Distillation method, for dense retrieval. |
ZHENGHAO LIN et. al. |
2023 | 8 | Interaction-level Membership Inference Attack Against Federated Recommender Systems IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To mitigate the interaction-level membership attack threats, we design a simple yet effective defense method to significantly reduce the attacker’s inference accuracy without losing recommendation performance. |
WEI YUAN et. al. |
2023 | 9 | Collaboration-Aware Graph Convolutional Network for Recommender Systems IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: After demonstrating the benefits of leveraging collaborations from neighbors with higher CIR, we propose a recommendation-tailored GNN, Collaboration-Aware Graph Convolutional Network (CAGCN), that goes beyond 1-Weisfeiler-Lehman(1-WL) test in distinguishing non-bipartite-subgraph-isomorphic graphs. |
Yu Wang; Yuying Zhao; Yi Zhang; Tyler Derr; |
2023 | 10 | Balancing Unobserved Confounding with A Few Unbiased Ratings in Debiased Recommendations IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a theoretically guaranteed model-agnostic balancing approach that can be applied to any existing debiasing method with the aim of combating unobserved confounding and model misspecification. |
Haoxuan Li; Yanghao Xiao; Chunyuan Zheng; Peng Wu; |
2022 | 1 | KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization for Relation Extraction IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Furthermore, there exists abundant semantic and prior knowledge among the relation labels that cannot be ignored. To this end, we focus on incorporating knowledge among relation labels into prompt-tuning for relation extraction and propose a Knowledge-aware Prompt-tuning approach with synergistic optimization (KnowPrompt). |
XIANG CHEN et. al. |
2022 | 2 | Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To tackle the above issue, we propose a novel contrastive learning approach, named Neighborhood-enriched Contrastive Learning, named NCL, which explicitly incorporates the potential neighbors into contrastive pairs. |
Zihan Lin; Changxin Tian; Yupeng Hou; Wayne Xin Zhao; |
2022 | 3 | SimGRACE: A Simple Framework for Graph Contrastive Learning Without Data Augmentation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: All of these limit the efficiency and more general applicability of existing GCL methods. To circumvent these crucial issues, we propose a Simple framework for GRAph Contrastive lEarning, SimGRACE for brevity, which does not require data augmentations. |
Jun Xia; Lirong Wu; Jintao Chen; Bozhen Hu; Stan Z. Li; |
2022 | 4 | Intent Contrastive Learning for Sequential Recommendation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To investigate the benefits of latent intents and leverage them effectively for recommendation, we propose Intent Contrastive Learning (ICL), a general learning paradigm that leverages a latent intent variable into SR. |
Yongjun Chen; Zhiwei Liu; Jia Li; Julian McAuley; Caiming Xiong; |
2022 | 5 | Filter-enhanced MLP Is All You Need for Sequential Recommendation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Motivated by it, we propose FMLP-Rec, an all-MLP model with learnable filters for sequential recommendation task. |
Kun Zhou; Hui Yu; Wayne Xin Zhao; Ji-Rong Wen; |
2022 | 6 | Towards Unsupervised Deep Graph Structure Learning IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a more practical GSL paradigm, unsupervised graph structure learning, where the learned graph topology is optimized by data itself without any external guidance (i.e., labels). |
YIXIN LIU et. al. |
2022 | 7 | EDITS: Modeling and Mitigating Data Bias for Graph Neural Networks IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Different from existing works that debias GNN models, we aim to debias the input attributed network to achieve fairer GNNs through feeding GNNs with less biased data. |
Yushun Dong; Ninghao Liu; Brian Jalaian; Jundong Li; |
2022 | 8 | FeedRec: News Feed Recommendation with Various User Feedbacks IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a news feed recommendation method that can exploit various kinds of user feedbacks to enhance both user interest modeling and model training. |
CHUHAN WU et. al. |
2022 | 9 | Cross-modal Ambiguity Learning for Multimodal Fake News Detection IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: A fundamental challenge of multimodal fake news detection lies in the inherent ambiguity across different content modalities, i.e., decisions made from unimodalities may disagree with each other, which may lead to inferior multimodal fake news detection. To address this issue, we formulate the cross-modal ambiguity learning problem from an information-theoretic perspective and propose CAFE — an ambiguity-aware multimodal fake news detection method. |
YIXUAN CHEN et. al. |
2022 | 10 | Sequential Recommendation Via Stochastic Self-Attention IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a novel STOchastic Self-Attention (STOSA) to overcome these issues. STOSA, in particular, embeds each item as a stochastic Gaussian distribution, the covariance of which encodes the uncertainty. |
ZIWEI FAN et. al. |
2022 | 11 | Learning and Evaluating Graph Neural Network Explanations Based on Counterfactual and Factual Reasoning IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we take insights of Counterfactual and Factual (CF2) reasoning from causal inference theory, to solve both the learning and evaluation problems in explainable GNNs. |
JUNTAO TAN et. al. |
2022 | 12 | Causal Representation Learning for Out-of-Distribution Recommendation IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we consider the Out-Of-Distribution (OOD) recommendation problem in an OOD environment with user feature shifts. |
WENJIE WANG et. al. |
2022 | 13 | Knowledge Graph Reasoning with Relational Digraph IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we introduce a novel relational structure, i.e., relational directed graph (r-digraph), which is composed of overlapped relational paths, to capture the KG’s local evidence. |
Yongqi Zhang; Quanming Yao; |
2022 | 14 | Multi-level Recommendation Reasoning Over Knowledge Graphs with Reinforcement Learning IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a reinforcement learning framework for multi-level recommendation reasoning over KGs, which leverages both ontology-view and instance-view KGs to model multi-level user interests. |
XITING WANG et. al. |
2022 | 15 | Recommendation Unlearning IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose RecEraser, a general and efficient machine unlearning framework tailored to recommendation tasks. |
Chong Chen; Fei Sun; Min Zhang; Bolin Ding; |
2021 | 1 | Graph Contrastive Learning with Adaptive Augmentation IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel graph contrastive representation learning method with adaptive augmentation that incorporates various priors for topological and semantic aspects of the graph. |
YANQIAO ZHU et. al. |
2021 | 2 | Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we fill this gap and propose a multi-channel hypergraph convolutional network to enhance social recommendation by leveraging high-order user relations. |
JUNLIANG YU et. al. |
2021 | 3 | Learning Intents Behind Interactions with Knowledge Graph for Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this study, we explore intents behind a user-item interaction by using auxiliary item knowledge, and propose a new model, Knowledge Graph-based Intent Network (KGIN). |
XIANG WANG et. al. |
2021 | 4 | Disentangling User Interest and Conformity for Recommendation with Causal Embedding IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present DICE, a general framework that learns representations where interest and conformity are structurally disentangled, and various backbone recommendation models could be smoothly integrated. |
YU ZHENG et. al. |
2021 | 5 | User-oriented Fairness in Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we address the unfairness problem in recommender systems from the user perspective. |
Yunqi Li; Hanxiong Chen; Zuohui Fu; Yingqiang Ge; Yongfeng Zhang; |
2021 | 6 | Interest-aware Message-Passing GCN for Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel Interest-aware Message-Passing GCN (IMP-GCN) recommendation model, which performs high-order graph convolution inside subgraphs. |
Fan Liu; Zhiyong Cheng; Lei Zhu; Zan Gao; Liqiang Nie; |
2021 | 7 | STAN: Spatio-Temporal Attention Network for Next Location Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To aggregate all relevant visits from user trajectory and recall the most plausible candidates from weighted representations, here we propose a Spatio-Temporal Attention Network (STAN) for location recommendation. |
Yingtao Luo; Qiang Liu; Zhaocheng Liu; |
2021 | 8 | Interpreting and Unifying Graph Neural Networks with An Optimization Framework IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we establish a surprising connection between different propagation mechanisms with a unified optimization problem, showing that despite the proliferation of various GNNs, in fact, their proposed propagation mechanisms are the optimal solution optimizing a feature fitting function over a wide class of graph kernels with a graph regularization term. |
Meiqi Zhu; Xiao Wang; Chuan Shi; Houye Ji; Peng Cui; |
2021 | 9 | Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To remedy the class imbalance problem of graph-based fraud detection, we propose a Pick and Choose Graph Neural Network (PC-GNN for short) for imbalanced supervised learning on graphs. |
YANG LIU et. al. |
2021 | 10 | Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we follow the textual encoding paradigm and aim to alleviate its drawbacks by augmenting it with graph embedding techniques – a complementary hybrid of both paradigms. |
BO WANG et. al. |
2021 | 11 | HDMI: High-order Deep Multiplex Infomax IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To address the above-mentioned problems, we propose a novel framework, called High-order Deep Multiplex Infomax (HDMI), for learning node embedding on multiplex networks in a self-supervised way. |
Baoyu Jing; Chanyoung Park; Hanghang Tong; |
2021 | 12 | Mixup for Node and Graph Classification IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose the Mixup methods for two fundamental tasks in graph learning: node and graph classification. |
Yiwei Wang; Wei Wang; Yuxuan Liang; Yujun Cai; Bryan Hooi; |
2021 | 13 | Beyond I.I.D.: Three Levels of Generalization for Question Answering on Knowledge Bases IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Instead, we suggest that KBQA models should have three levels of built-in generalization: i.i.d., compositional, and zero-shot. |
YU GU et. al. |
2021 | 14 | SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents a novel hierarchical subgraph-level selection and embedding-based graph neural network for graph classification, namely SUGAR, to learn more discriminative subgraph representations and respond in an explanatory way. |
QINGYUN SUN et. al. |
2021 | 15 | Heterogeneous Graph Neural Network Via Attribute Completion IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we hold that missing attributes can be acquired by a learnable manner, and propose a general framework for Heterogeneous Graph Neural Network via Attribute Completion (HGNN-AC), including pre-learning of topological embedding and attribute completion with attention mechanism. |
Di Jin; Cuiying Huo; Chundong Liang; Liang Yang; |
2020 | 1 | Heterogeneous Graph Transformer IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present the Heterogeneous Graph Transformer (HGT) architecture for modeling Web-scale heterogeneous graphs. |
Ziniu Hu; Yuxiao Dong; Kuansan Wang; Yizhou Sun; |
2020 | 2 | MAGNN: Metapath Aggregated Graph Neural Network For Heterogeneous Graph Embedding IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To address these three limitations, we propose a new model named Metapath Aggregated Graph Neural Network (MAGNN) to boost the final performance. |
Xinyu Fu; Jiani Zhang; Ziqiao Meng; Irwin King; |
2020 | 3 | Graph Representation Learning Via Graphical Mutual Information Maximization IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To this end, we propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. |
ZHEN PENG et. al. |
2020 | 4 | Traffic Flow Prediction Via Spatial Temporal Graph Neural Network IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel spatial temporal graph neural network for traffic flow prediction, which can comprehensively capture spatial and temporal patterns. |
XIAOYANG WANG et. al. |
2020 | 5 | Structural Deep Clustering Network IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Motivated by the great success of Graph Convolutional Network (GCN) in encoding the graph structure, we propose a Structural Deep Clustering Network (SDCN) to integrate the structural information into deep clustering. |
DEYU BO et. al. |
2020 | 6 | A First Look At Commercial 5G Performance On Smartphones IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We conduct to our knowledge a first measurement study of commercial 5G performance on smartphones by closely examining 5G networks of three carriers (two mmWave carriers, one mid-band carrier) in three U.S. cities. We have released the data collected from our study (referred to as 5Gophers) at https://fivegophers.umn.edu/www20. |
ARVIND NARAYANAN et. al. |
2020 | 7 | FairRec: Two-Sided Fairness For Personalized Recommendations In Two-Sided Platforms IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We investigate the problem of fair recommendation in the context of two-sided online platforms, comprising customers on one side and producers on the other. |
Gourab K Patro; Arpita Biswas; Niloy Ganguly; Krishna P. Gummadi; Abhijnan Chakraborty; |
2020 | 8 | Reducing Disparate Exposure In Ranking: A Learning To Rank Approach IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we explore a new in-processing approach: DELTR, a learning-to-rank framework that addresses potential issues of discrimination and unequal opportunity in rankings at training time. |
Meike Zehlike; Carlos Castillo; |
2020 | 9 | Reinforced Negative Sampling Over Knowledge Graph For Recommendation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we hypothesize that item knowledge graph (KG), which provides rich relations among items and KG entities, could be useful to infer informative and factual negative samples. We release the codes and datasets at https://github.com/xiangwang1223/kgpolicy. |
XIANG WANG et. al. |
2020 | 10 | Generating Clarifying Questions For Information Retrieval IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: Search queries are often short, and the underlying user intent may be ambiguous. This makes it challenging for search engines to predict possible intents, only one of which may … |
Hamed Zamani; Susan Dumais; Nick Craswell; Paul Bennett; Gord Lueck; |
2020 | 11 | Learning Model-Agnostic Counterfactual Explanations For Tabular Data IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our contribution is twofold. |
Martin Pawelczyk; Klaus Broelemann; Gjergji Kasneci; |
2020 | 12 | ASER: A Large-scale Eventuality Knowledge Graph IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To fill this gap, we develop ASER (activities, states, events, and their relations), a large-scale eventuality knowledge graph extracted from more than 11-billion-token unstructured textual data. |
Hongming Zhang; Xin Liu; Haojie Pan; Yangqiu Song; Cane Wing-Ki Leung; |
2020 | 13 | One2Multi Graph Autoencoder For Multi-view Graph Clustering IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we make the first attempt to employ deep learning technique for attributed multi-view graph clustering, and propose a novel task-guided One2Multi graph autoencoder clustering framework. |
SHAOHUA FAN et. al. |
2020 | 14 | Algorithmic Effects On The Diversity Of Consumption On Spotify IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we study the user experience on Spotify, a popular music streaming service, through the lens of diversity—the coherence of the set of songs a user listens to. |
Ashton Anderson; Lucas Maystre; Ian Anderson; Rishabh Mehrotra; Mounia Lalmas; |
2020 | 15 | Influence Function Based Data Poisoning Attacks To Top-N Recommender Systems IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we show that an attacker can launch a data poisoning attack to a recommender system to make recommendations as the attacker desires via injecting fake users with carefully crafted user-item interaction data. |
Minghong Fang; Neil Zhenqiang Gong; Jia Liu; |
2019 | 1 | Heterogeneous Graph Attention Network IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: Graph neural network, as a powerful graph representation technique based on deep learning, has shown superior performance and attracted considerable research interest. However, it … |
XIAO WANG et. al. |
2019 | 2 | Graph Neural Networks For Social Recommendation IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To address the three aforementioned challenges simultaneously, in this paper, we present a novel graph neural network framework (GraphRec) for social recommendations. |
WENQI FAN et. al. |
2019 | 3 | Knowledge Graph Convolutional Networks For Recommender Systems IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose Knowledge Graph Convolutional Networks (KGCN), an end-to-end framework that captures inter-item relatedness effectively by mining their associated attributes on the KG. |
Hongwei Wang; Miao Zhao; Xing Xie; Wenjie Li; Minyi Guo; |
2019 | 4 | Unifying Knowledge Graph Learning And Recommendation: Towards A Better Understanding Of User Preferences IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we jointly learn the model of recommendation and knowledge graph completion. |
Yixin Cao; Xiang Wang; Xiangnan He; Zikun Hu; Tat-Seng Chua; |
2019 | 5 | Multi-Task Feature Learning For Knowledge Graph Enhanced Recommendation IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we consider knowledge graphs as the source of side information. |
HONGWEI WANG et. al. |
2019 | 6 | MVAE: Multimodal Variational Autoencoder For Fake News Detection IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose an end-to-end network, Multimodal Variational Autoencoder (MVAE), which uses a bimodal variational autoencoder coupled with a binary classifier for the task of fake news detection. |
Dhruv Khattar; Jaipal Singh Goud; Manish Gupta; Vasudeva Varma; |
2019 | 7 | Dual Graph Attention Networks For Deep Latent Representation Of Multifaceted Social Effects In Recommender Systems IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To relax this strong assumption, in this paper, we propose dual graph attention networks to collaboratively learn representations for two-fold social effects, where one is modeled by a user-specific attention weight and the other is modeled by a dynamic and context-aware attention weight. |
QITIAN WU et. al. |
2019 | 8 | Google Dataset Search: Building A Search Engine For Datasets In An Open Web Ecosystem IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we discuss Google Dataset Search, a dataset-discovery tool that provides search capabilities over potentially all datasets published on the Web. |
Dan Brickley; Matthew Burgess; Natasha Noy; |
2019 | 9 | Revisiting User Mobility And Social Relationships In LBSNs: A Hypergraph Embedding Approach IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, by revisiting user mobility and social relationships based on a large-scale LBSN dataset collected over a long-term period, we propose LBSN2Vec, a hypergraph embedding approach designed specifically for LBSN data for automatic feature learning. |
Dingqi Yang; Bingqing Qu; Jie Yang; Philippe Cudre-Mauroux; |
2019 | 10 | (Mis)Information Dissemination In WhatsApp: Gathering, Analyzing And Countermeasures IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we analyze information dissemination within WhatsApp, focusing on publicly accessible political-oriented groups, collecting all shared messages during major social events in Brazil: a national truck drivers’ strike and the Brazilian presidential campaign. |
GUSTAVO RESENDE et. al. |
2019 | 11 | Efficient Ridesharing Order Dispatching With Mean Field Multi-Agent Reinforcement Learning IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we address the order dispatching problem using multi-agent reinforcement learning (MARL), which follows the distributed nature of the peer-to-peer ridesharing problem and possesses the ability to capture the stochastic demand-supply dynamics in large-scale ridesharing scenarios. |
MINNE LI et. al. |
2019 | 12 | Embarrassingly Shallow Autoencoders For Sparse Data IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Combining simple elements from the literature, we define a linear model that is geared toward sparse data, in particular implicit feedback data for recommender systems. |
Harald Steck; |
2019 | 13 | CityFlow: A Multi-Agent Reinforcement Learning Environment For Large Scale City Traffic Scenario IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: Traffic signal control is an emerging application scenario for reinforcement learning. Besides being as an important problem that affects people’s daily life in commuting, traffic … |
HUICHU ZHANG et. al. |
2019 | 14 | Detect Rumors On Twitter By Promoting Information Campaigns With Generative Adversarial Learning IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we attempt to fight such chaos with itself to make automatic rumor detection more robust and effective. |
Jing Ma; Wei Gao; Kam-Fai Wong; |
2019 | 15 | Jointly Learning Explainable Rules For Recommendation With Knowledge Graph IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel joint learning framework to integrate induction of explainable rules from knowledge graph with construction of a rule-guided neural recommendation model. |
WEIZHI MA et. al. |
2018 | 1 | Variational Autoencoders For Collaborative Filtering IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This non-linear probabilistic model enables us to go beyond the limited modeling capacity of linear factor models which still largely dominate collaborative filtering research.We introduce a generative model with multinomial likelihood and use Bayesian inference for parameter estimation. |
Dawen Liang; Rahul G. Krishnan; Matthew D. Hoffman; Tony Jebara; |
2018 | 2 | DKN: Deep Knowledge-Aware Network For News Recommendation IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To solve the above problem, in this paper, we propose a deep knowledge-aware network (DKN) that incorporates knowledge graph representation into news recommendation. |
Hongwei Wang; Fuzheng Zhang; Xing Xie; Minyi Guo; |
2018 | 3 | Unsupervised Anomaly Detection Via Variational Auto-Encoder For Seasonal KPIs In Web Applications IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we proposed Donut, an unsupervised anomaly detection algorithm based on VAE. |
HAOWEN XU et. al. |
2018 | 4 | DRN: A Deep Reinforcement Learning Framework For News Recommendation IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel Deep Reinforcement Learning framework for news recommendation. |
GUANJIE ZHENG et. al. |
2018 | 5 | DeepMove: Predicting Human Mobility With Attentional Recurrent Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose DeepMove, an attentional recurrent network for mobility prediction from lengthy and sparse trajectories. |
JIE FENG et. al. |
2018 | 6 | Neural Attentional Rating Regression With Review-level Explanations IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we introduce a novel attention mechanism to explore the usefulness of reviews, and propose a Neural Attentional Regression model with Review-level Explanations (NARRE) for recommendation. |
Chong Chen; Min Zhang; Yiqun Liu; Shaoping Ma; |
2018 | 7 | Large-Scale Hierarchical Text Classification With Recursively Regularized Deep Graph-CNN IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a graph-CNN based deep learning model to first convert texts to graph-of-words, and then use graph convolution operations to convolve the word graph. |
HAO PENG et. al. |
2018 | 8 | Dual Graph Convolutional Networks For Graph-Based Semi-Supervised Classification IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a simple and scalable semi-supervised learning method for graph-structured data in which only a very small portion of the training data are labeled. |
Chenyi Zhuang; Qiang Ma; |
2018 | 9 | Political Discourse On Social Media: Echo Chambers, Gatekeepers, And The Price Of Bipartisanship IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper studies the phenomenon of political echo chambers on social media. |
Kiran Garimella; Gianmarco De Francisci Morales; Aristides Gionis; Michael Mathioudakis; |
2018 | 10 | Community Interaction And Conflict On The Web IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Altogether, this work presents a data-driven view of community interactions and conflict, and paves the way towards healthier online communities. |
Srijan Kumar; William L. Hamilton; Jure Leskovec; Dan Jurafsky; |
2018 | 11 | Aspect-Aware Latent Factor Model: Rating Prediction With Ratings And Reviews IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we employ textual review information with ratings to tackle these limitations. |
Zhiyong Cheng; Ying Ding; Lei Zhu; Mohan Kankanhalli; |
2018 | 12 | Latent Relational Metric Learning Via Memory-based Attention For Collaborative Ranking IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper proposes a new neural architecture for collaborative ranking with implicit feedback. |
Yi Tay; Luu Anh Tuan; Siu Cheung Hui; |
2018 | 13 | Detecting Ponzi Schemes On Ethereum: Towards Healthier Blockchain Technology IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To help dealing with this issue, this paper proposes an approach to detect Ponzi schemes on blockchain by using data mining and machine learning methods. |
WEILI CHEN et. al. |
2018 | 14 | VERSE: Versatile Graph Embeddings From Similarity Measures IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we carry the similarity orientation of previous works to its logical conclusion; we propose VERtex Similarity Embeddings (VERSE), a simple, versatile, and memory-efficient method that derives graph embeddings explicitly calibrated to preserve the distributions of a selected vertex-to-vertex similarity measure. |
Anton Tsitsulin; Davide Mottin; Panagiotis Karras; Emmanuel Müller; |
2018 | 15 | TEM: Tree-enhanced Embedding Model For Explainable Recommendation IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we propose a novel solution named Tree-enhanced Embedding Method that combines the strengths of embedding-based and tree-based models. |
Xiang Wang; Xiangnan He; Fuli Feng; Liqiang Nie; Tat-Seng Chua; |
2017 | 1 | Neural Collaborative Filtering IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we strive to develop techniques based on neural networks to tackle the key problem in recommendation — collaborative filtering — on the basis of implicit feedback. |
XIANGNAN HE et. al. |
2017 | 2 | Ex Machina: Personal Attacks Seen At Scale IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: The contribution of this paper is to develop and illustrate a method that combines crowdsourcing and machine learning to analyze personal attacks at scale. |
Ellery Wulczyn; Nithum Thain; Lucas Dixon; |
2017 | 3 | DeepSense: A Unified Deep Learning Framework For Time-Series Mobile Sensing Data Processing IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To this end, we propose DeepSense, a deep learning framework that directly addresses the aforementioned noise and feature customization challenges in a unified manner. |
Shuochao Yao; Shaohan Hu; Yiran Zhao; Aston Zhang; Tarek Abdelzaher; |
2017 | 4 | Learning To Match Using Local And Distributed Representations Of Text For Web Search IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a novel document ranking model composed of two separate deep neural networks, one that matches the query and the document using a local representation, and another that matches the query and the document using learned distributed representations. |
Bhaskar Mitra; Fernando Diaz; Nick Craswell; |
2017 | 5 | Collaborative Metric Learning IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we study the connection between metric learning and collaborative filtering. |
CHENG-KANG HSIEH et. al. |
2017 | 6 | Dynamic Key-Value Memory Networks For Knowledge Tracing IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To solve these problems, this work introduces a new model called Dynamic Key-Value Memory Networks (DKVMN) that can exploit the relationships between underlying concepts and directly output a student’s mastery level of each concept. |
Jiani Zhang; Xingjian Shi; Irwin King; Dit-Yan Yeung; |
2017 | 7 | Explicit Semantic Ranking For Academic Search Via Knowledge Graph Embedding IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper introduces Explicit Semantic Ranking (ESR), a new ranking technique that leverages knowledge graph embedding. |
Chenyan Xiong; Russell Power; Jamie Callan; |
2017 | 8 | CoType: Joint Extraction Of Typed Entities And Relations With Knowledge Bases IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we investigate joint extraction of typed entities and relations with labeled data heuristically obtained from knowledge bases (i.e., distant supervision). |
XIANG REN et. al. |
2017 | 9 | DeepCas: An End-to-end Predictor Of Information Cascades IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present algorithms that learn the representation of cascade graphs in an end-to-end manner, which significantly improve the performance of cascade prediction over strong baselines including feature based methods, node embedding methods, and graph kernel methods. |
Cheng Li; Jiaqi Ma; Xiaoxiao Guo; Qiaozhu Mei; |
2017 | 10 | Neural Network-based Question Answering Over Knowledge Graphs On Word And Character Level IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we follow a quite different approach: We train a neural network for answering simple questions in an end-to-end manner, leaving all decisions to the model. |
Denis Lukovnikov; Asja Fischer; Jens Lehmann; Sören Auer; |
2017 | 11 | What Your Images Reveal: Exploiting Visual Contents For Point-of-Interest Recommendation IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study the problem of enhancing POI recommendation with visual contents. |
SUHANG WANG et. al. |
2017 | 12 | A Generic Coordinate Descent Framework For Learning From Implicit Feedback IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we provide a new framework for deriving efficient CD algorithms for complex recommender models. |
Immanuel Bayer; Xiangnan He; Bhargav Kanagal; Steffen Rendle; |
2017 | 13 | Automated Template Generation For Question Answering Over Knowledge Graphs IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents QUINT, a system that automatically learns utterance-query templates solely from user questions paired with their answers. |
Abdalghani Abujabal; Mohamed Yahya; Mirek Riedewald; Gerhard Weikum; |
2017 | 14 | An Army Of Me: Sockpuppets In Online Discussion Communities IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we study sockpuppetry across nine discussion communities, and show that sockpuppets differ from ordinary users in terms of their posting behavior, linguistic traits, as well as social network structure. |
Srijan Kumar; Justin Cheng; Jure Leskovec; V.S. Subrahmanian; |
2017 | 15 | Expecting To Be HIP: Hawkes Intensity Processes For Social Media Popularity IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We develop a novel mathematical model, the Hawkes intensity process, which can explain the complex popularity history of each video according to its type of content, network of diffusion, and sensitivity to promotion. |
MARIAN-ANDREI RIZOIU et. al. |
2016 | 1 | Ups And Downs: Modeling The Visual Evolution Of Fashion Trends With One-Class Collaborative Filtering IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we build novel models for the One-Class Collaborative Filtering setting, where our goal is to estimate users’ fashion-aware personalized ranking functions based on their past feedback. |
Ruining He; Julian McAuley; |
2016 | 2 | Abusive Language Detection In Online User Content IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we develop a machine learning based method to detect hate speech on online user comments from two domains which outperforms a state-of-the-art deep learning approach. We also develop a corpus of user comments annotated for abusive language, the first of its kind. |
Chikashi Nobata; Joel Tetreault; Achint Thomas; Yashar Mehdad; Yi Chang; |
2016 | 3 | Visualizing Large-scale And High-dimensional Data IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose the LargeVis, a technique that first constructs an accurately approximated K-nearest neighbor graph from the data and then layouts the graph in the low-dimensional space. |
Jian Tang; Jingzhou Liu; Ming Zhang; Qiaozhu Mei; |
2016 | 4 | Modeling User Exposure In Recommendation IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a new probabilistic approach that directly incorporates user exposure to items into collaborative filtering. |
Dawen Liang; Laurent Charlin; James McInerney; David M. Blei; |
2016 | 5 | Winning Arguments: Interaction Dynamics And Persuasion Strategies In Good-faith Online Discussions IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we study these interactions to understand the mechanisms behind persuasion. |
Chenhao Tan; Vlad Niculae; Cristian Danescu-Niculescu-Mizil; Lillian Lee; |
2016 | 6 | Disinformation On The Web: Impact, Characteristics, And Detection Of Wikipedia Hoaxes IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we study false information on Wikipedia by focusing on the hoax articles that have been created throughout its history. |
Srijan Kumar; Robert West; Jure Leskovec; |
2016 | 7 | Foundations Of JSON Schema IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we provide the first formal definition of syntax and semantics for JSON Schema and use it to show that implementing this layer on top of JSON is feasible in practice. |
Felipe Pezoa; Juan L. Reutter; Fernando Suarez; Martín Ugarte; Domagoj Vrgoč; |
2016 | 8 | From Freebase To Wikidata: The Great Migration IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we report on the ongoing transfer efforts and data mapping challenges, and provide an analysis of the effort so far. |
Thomas Pellissier Tanon; Denny Vrandečić; Sebastian Schaffert; Thomas Steiner; Lydia Pintscher; |
2016 | 9 | The Death And Life Of Great Italian Cities: A Mobile Phone Data Perspective IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we identify a valuable alternative to the lengthy and costly collection of activity survey data: mobile phone data. |
MARCO DE NADAI et. al. |
2016 | 10 | A Neural Click Model For Web Search IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose an alternative based on the idea of distributed representations: to represent the user’s information need and the information available to the user with a vector state. |
Alexey Borisov; Ilya Markov; Maarten de Rijke; Pavel Serdyukov; |
2016 | 11 | An Empirical Analysis Of Algorithmic Pricing On Amazon Marketplace IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this study, we develop a methodology for detecting algorithmic pricing, and use it empirically to analyze their prevalence and behavior on Amazon Marketplace. |
Le Chen; Alan Mislove; Christo Wilson; |
2016 | 12 | Addressing Complex And Subjective Product-Related Queries With Customer Reviews IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we hope to fuse these two paradigms: given a large volume of previously answered queries about products, we hope to automatically learn whether a review of a product is relevant to a given query. |
Julian McAuley; Alex Yang; |
2016 | 13 | Linking Users Across Domains With Location Data: Theory And Validation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we address the reconciliation problem for location-based datasets and introduce a robust method for this general setting. |
Christopher Riederer; Yunsung Kim; Augustin Chaintreau; Nitish Korula; Silvio Lattanzi; |
2016 | 14 | Probabilistic Bag-Of-Hyperlinks Model For Entity Linking IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We here propose a probabilistic approach that makes use of an effective graphical model to perform collective entity disambiguation. |
Octavian-Eugen Ganea; Marina Ganea; Aurelien Lucchi; Carsten Eickhoff; Thomas Hofmann; |
2016 | 15 | Mining Aspect-Specific Opinion Using A Holistic Lifelong Topic Model IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To further improve it, we incorporate the idea of lifelong machine learning and propose a more advanced model, called the LAST (Lifelong Aspect-based Sentiment Topic) model. |
Shuai Wang; Zhiyuan Chen; Bing Liu; |
2015 | 1 | LINE: Large-scale Information Network Embedding IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel network embedding method called the “LINE,” which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. |
JIAN TANG et. al. |
2015 | 2 | A Multi-View Deep Learning Approach For Cross Domain User Modeling In Recommendation Systems IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we propose a content-based recommendation system to address both the recommendation quality and the system scalability. |
Ali Mamdouh Elkahky; Yang Song; Xiaodong He; |
2015 | 3 | Enquiring Minds: Early Detection Of Rumors In Social Media From Enquiry Posts IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a technique to identify trending rumors, which we define as topics that include disputed factual claims. |
Zhe Zhao; Paul Resnick; Qiaozhu Mei; |
2015 | 4 | Statistically Significant Detection Of Linguistic Change IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a new computational approach for tracking and detecting statistically significant linguistic shifts in the meaning and usage of words. |
Vivek Kulkarni; Rami Al-Rfou; Bryan Perozzi; Steven Skiena; |
2015 | 5 | GERBIL: General Entity Annotator Benchmarking Framework IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present GERBIL, an evaluation framework for semantic entity annotation. |
RICARDO USBECK et. al. |
2015 | 6 | Cookies That Give You Away: The Surveillance Implications Of Web Tracking IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To evaluate the effectiveness of our attack, we introduce a methodology that combines web measurement and network measurement. |
STEVEN ENGLEHARDT et. al. |
2015 | 7 | The K-clique Densest Subgraph Problem IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we introduce the k-clique densest subgraph problem, k ≥ 2. |
Charalampos Tsourakakis; |
2015 | 8 | LightLDA: Big Topic Models On Modest Computer Clusters IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our major contributions include: 1) a new, highly-efficient O(1) Metropolis-Hastings sampling algorithm, whose running cost is (surprisingly) agnostic of model size, and empirically converges nearly an order of magnitude more quickly than current state-of-the-art Gibbs samplers; 2) a model-scheduling scheme to handle the big model challenge, where each worker machine schedules the fetch/use of sub-models as needed, resulting in a frugal use of limited memory capacity and network bandwidth; 3) a differential data-structure for model storage, which uses separate data structures for high- and low-frequency words to allow extremely large models to fit in memory, while maintaining high inference speed. |
JINHUI YUAN et. al. |
2015 | 9 | Automatic Online Evaluation Of Intelligent Assistants IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We develop consistent and automatic approaches that can evaluate different tasks in voice-activated intelligent assistants. |
JIEPU JIANG et. al. |
2015 | 10 | The Dynamics Of Micro-Task Crowdsourcing: The Case Of Amazon MTurk IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we adopt a data-driven approach to (A) perform a long-term analysis of a popular micro-task crowdsourcing platform and understand the evolution of its main actors (workers, requesters, and platform). |
Djellel Eddine Difallah; Michele Catasta; Gianluca Demartini; Panagiotis G. Ipeirotis; Philippe Cudré-Mauroux; |
2015 | 11 | PriVaricator: Deceiving Fingerprinters With Little White Lies IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we propose PriVaricator, a solution to the problem of browser-based fingerprinting. |
Nick Nikiforakis; Wouter Joosen; Benjamin Livshits; |
2015 | 12 | Incentivizing High Quality Crowdwork IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We study the causal effects of financial incentives on the quality of crowdwork. |
Chien-Ju Ho; Aleksandrs Slivkins; Siddharth Suri; Jennifer Wortman Vaughan; |
2015 | 13 | Improving User Topic Interest Profiles By Behavior Factorization IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here we propose to separately model users’ topical interests that come from these various behavioral signals in order to construct better user profiles. |
Zhe Zhao; Zhiyuan Cheng; Lichan Hong; Ed H. Chi; |
2015 | 14 | Network A/B Testing: From Sampling To Estimation IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study the problem of network A/B testing in real networks, which have substantially different characteristics from the simulated random networks studied in previous works. |
Huan Gui; Ya Xu; Anmol Bhasin; Jiawei Han; |
2015 | 15 | Uncovering The Small Community Structure In Large Networks: A Local Spectral Approach IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel approach for finding overlapping communities called LEMON (Local Expansion via Minimum One Norm). |
Yixuan Li; Kun He; David Bindel; John E. Hopcroft; |
2014 | 1 | Engaging With Massive Online Courses IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we use such trace data to develop a conceptual framework for understanding how users currently engage with MOOCs. |
Ashton Anderson; Daniel Huttenlocher; Jon Kleinberg; Jure Leskovec; |
2014 | 2 | Exploring The Filter Bubble: The Effect Of Using Recommender Systems On Content Diversity IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We contribute a novel metric to measure content diversity based on information encoded in user-generated tags, and we present a new set of methods to examine the temporal effect of recommender systems on the user experience. |
Tien T. Nguyen; Pik-Mai Hui; F. Maxwell Harper; Loren Terveen; Joseph A. Konstan; |
2014 | 3 | What Makes An Image Popular? IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we show the importance of image cues such as color, gradients, deep learning features and the set of objects present, as well as the importance of various social cues such as number of friends or number of photos uploaded that lead to high or low popularity of images. |
Aditya Khosla; Atish Das Sarma; Raffay Hamid; |
2014 | 4 | Can Cascades Be Predicted? IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we develop a framework for addressing cascade prediction problems. |
Justin Cheng; Lada Adamic; P. Alex Dow; Jon Michael Kleinberg; Jure Leskovec; |
2014 | 5 | Test-driven Evaluation Of Linked Data Quality IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a methodology for test-driven quality assessment of Linked Data, which is inspired by test-driven software development. |
DIMITRIS KONTOKOSTAS et. al. |
2014 | 6 | Knowledge Base Completion Via Search-based Question Answering IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a way to leverage existing Web-search-based question-answering technology to fill in the gaps in knowledge bases in a targeted way. |
ROBERT WEST et. al. |
2014 | 7 | Community-based Bayesian Aggregation Models For Crowdsourcing IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To mitigate this issue, we propose a novel community-based Bayesian label aggregation model, CommunityBCC, which assumes that crowd workers conform to a few different types, where each type represents a group of workers with similar confusion matrices. |
Matteo Venanzi; John Guiver; Gabriella Kazai; Pushmeet Kohli; Milad Shokouhi; |
2014 | 8 | The Bursty Dynamics Of The Twitter Information Network IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here, we study ways in which network structure reacts to users posting and sharing content. |
Seth A. Myers; Jure Leskovec; |
2014 | 9 | Designing And Deploying Online Field Experiments IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We thus introduce a language for online field experiments called PlanOut. |
Eytan Bakshy; Dean Eckles; Michael S. Bernstein; |
2014 | 10 | Reconciling Mobile App Privacy And Usability On Smartphones: Could User Privacy Profiles Help? IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we report on the results of a study analyzing people’s privacy preferences when it comes to granting permissions to different mobile apps. |
Bin Liu; Jialiu Lin; Norman Sadeh; |
2014 | 11 | Don’t Like RDF Reification?: Making Statements About Statements Using Singleton Property IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel approach called Singleton Property for representing statements about statements and provide a formal semantics for it. |
Vinh Nguyen; Olivier Bodenreider; Amit Sheth; |
2014 | 12 | Quizz: Targeted Crowdsourcing With A Billion (potential) Users IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe Quizz, a gamified crowdsourcing system that simultaneously assesses the knowledge of users and acquires new knowledge from them. |
Panagiotis G. Ipeirotis; Evgeniy Gabrilovich; |
2014 | 13 | High Quality, Scalable And Parallel Community Detection For Large Real Graphs IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel disjoint community detection algorithm called Scalable Community Detection (SCD). |
Arnau Prat-Pérez; David Dominguez-Sal; Josep-Lluis Larriba-Pey; |
2014 | 14 | Formalisation And Experiences Of R2RML-based SPARQL To SQL Query Translation Using Morph IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we describe an extension of a well-known algorithm for SPARQL to SQL translation, originally formalised for RDBMS-backed triple stores, that takes into account R2RML mappings. |
Freddy Priyatna; Oscar Corcho; Juan Sequeda; |
2014 | 15 | Local Collaborative Ranking IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we examine an alternative approach in which the rating matrix is locally low-rank. |
Joonseok Lee; Samy Bengio; Seungyeon Kim; Guy Lebanon; Yoram Singer; |
2013 | 1 | A Biterm Topic Model For Short Texts IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel way for modeling topics in short texts, referred as biterm topic model (BTM). |
Xiaohui Yan; Jiafeng Guo; Yanyan Lan; Xueqi Cheng; |
2013 | 2 | Traveling The Silk Road: A Measurement Analysis Of A Large Anonymous Online Marketplace IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We perform a comprehensive measurement analysis of Silk Road, an anonymous, international online marketplace that operates as a Tor hidden service and uses Bitcoin as its exchange currency. |
Nicolas Christin; |
2013 | 3 | Distributed Large-scale Natural Graph Factorization IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a framework for large-scale graph decomposition and inference. |
Amr Ahmed; Nino Shervashidze; Shravan Narayanamurthy; Vanja Josifovski; Alexander J. Smola; |
2013 | 4 | AMIE: Association Rule Mining Under Incomplete Evidence In Ontological Knowledge Bases IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we develop a rule mining model that is explicitly tailored to support the OWA scenario. |
Luis Antonio Galárraga; Christina Teflioudi; Katja Hose; Fabian Suchanek; |
2013 | 5 | ClausIE: Clause-based Open Information Extraction IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose ClausIE, a novel, clause-based approach to open information extraction, which extracts relations and their arguments from natural language text. |
Luciano Del Corro; Rainer Gemulla; |
2013 | 6 | WTF: The Who To Follow Service At Twitter IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe and evaluate a few graph recommendation algorithms implemented in Cassovary, including a novel approach based on a combination of random walks and SALSA. |
PANKAJ GUPTA et. al. |
2013 | 7 | From Amateurs To Connoisseurs: Modeling The Evolution Of User Expertise Through Online Reviews IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Thus our goal in this paper is to recommend products that a user will enjoy now, while acknowledging that their tastes may have changed over time, and may change again in the future. |
Julian John McAuley; Jure Leskovec; |
2013 | 8 | Unsupervised Sentiment Analysis With Emotional Signals IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Inspired by the wide availability of emotional signals in social media, we propose to study the problem of unsupervised sentiment analysis with emotional signals. |
Xia Hu; Jiliang Tang; Huiji Gao; Huan Liu; |
2013 | 9 | Steering User Behavior With Badges IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study how badges can influence and steer user behavior on a site—leading both to increased participation and to changes in the mix of activities a user pursues on the site. |
Ashton Anderson; Daniel Huttenlocher; Jon Kleinberg; Jure Leskovec; |
2013 | 10 | Measuring Personalization Of Web Search IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In light of this situation, we make three contributions. |
ANIKO HANNAK et. al. |
2013 | 11 | No Country For Old Members: User Lifecycle And Linguistic Change In Online Communities IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a framework for tracking linguistic change as it happens and for understanding how specific users react to these evolving norms. |
Cristian Danescu-Niculescu-Mizil; Robert West; Dan Jurafsky; Jure Leskovec; Christopher Potts; |
2013 | 12 | CopyCatch: Stopping Group Attacks By Spotting Lockstep Behavior In Social Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we focus on the social network Facebook and the problem of discerning ill-gotten Page Likes, made by spammers hoping to turn a profit, from legitimate Page Likes. |
Alex Beutel; Wanhong Xu; Venkatesan Guruswami; Christopher Palow; Christos Faloutsos; |
2013 | 13 | Efficient Community Detection In Large Networks Using Content And Links IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we discuss a very simple approach of combining content and link information in graph structures for the purpose of community discovery, a fundamental task in network analysis. |
Yiye Ruan; David Fuhry; Srinivasan Parthasarathy; |
2013 | 14 | Truthful Incentives In Crowdsourcing Tasks Using Regret Minimization Mechanisms IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we address these questions and present mechanisms using the approach of regret minimization in online learning. |
Adish Singla; Andreas Krause; |
2013 | 15 | Multi-label Learning With Millions Of Labels: Recommending Advertiser Bid Phrases For Web Pages IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we eschew this paradigm, and demonstrate that it is possible to efficiently predict the relevant subset of queries from a large set of monetizable ones by posing the problem as a multi-label learning task with each query being represented by a separate label. |
Rahul Agrawal; Archit Gupta; Yashoteja Prabhu; Manik Varma; |
2012 | 1 | The Role Of Social Networks In Information Diffusion IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We show that, although stronger ties are individually more influential, it is the more abundant weak ties who are responsible for the propagation of novel information. |
Eytan Bakshy; Itamar Rosenn; Cameron Marlow; Lada Adamic; |
2012 | 2 | Spotting Fake Reviewer Groups In Consumer Reviews IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: For reviews to reflect genuine user experiences and opinions, such spam reviews should be detected. Additionally, we also built a labeled dataset of fake reviewer groups. |
Arjun Mukherjee; Bing Liu; Natalie Glance; |
2012 | 3 | Template-based Question Answering Over RDF Data IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To circumvent this problem, we present a novel approach that relies on a parse of the question to produce a SPARQL template that directly mirrors the internal structure of the question. |
CHRISTINA UNGER et. al. |
2012 | 4 | ZenCrowd: Leveraging Probabilistic Reasoning And Crowdsourcing Techniques For Large-scale Entity Linking IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We tackle the problem of entity linking for large collections of online pages; Our system, ZenCrowd, identifies entities from natural language text using state of the art techniques and automatically connects them to the Linked Open Data cloud. |
Gianluca Demartini; Djellel Eddine Difallah; Philippe Cudré-Mauroux; |
2012 | 5 | Discovering Geographical Topics In The Twitter Stream IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we focus on Twitter and present an algorithm by modeling diversity in tweets based on topical diversity, geographical diversity, and an interest distribution of the user. |
Liangjie Hong; Amr Ahmed; Siva Gurumurthy; Alexander J. Smola; Kostas Tsioutsiouliklis; |
2012 | 6 | Understanding And Combating Link Farming In The Twitter Social Network IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To this end, we conducted a detailed analysis of links acquired by over 40,000 spammer accounts suspended by Twitter. |
SAPTARSHI GHOSH et. al. |
2012 | 7 | Factorizing YAGO: Scalable Machine Learning For Linked Data IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here, we present an efficient approach to relational learning on LOD data, based on the factorization of a sparse tensor that scales to data consisting of millions of entities, hundreds of relations and billions of known facts. |
Maximilian Nickel; Volker Tresp; Hans-Peter Kriegel; |
2012 | 8 | Dynamical Classes Of Collective Attention In Twitter IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here we focus on spikes of collective attention in Twitter, and specifically on peaks in the popularity of hashtags. |
Janette Lehmann; Bruno Gonçalves; José J. Ramasco; Ciro Cattuto; |
2012 | 9 | Analyzing Spammers’ Social Networks For Fun And Profit: A Case Study Of Cyber Criminal Ecosystem On Twitter IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we perform an empirical analysis of the cyber criminal ecosystem on Twitter. |
Chao Yang; Robert Harkreader; Jialong Zhang; Seungwon Shin; Guofei Gu; |
2012 | 10 | Online Team Formation In Social Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose efficient algorithms that address all these requirements: our algorithms form teams that always satisfy the required skills, provide approximation guarantees with respect to team communication overhead, and they are online-competitive with respect to load balancing. |
Aris Anagnostopoulos; Luca Becchetti; Carlos Castillo; Aristides Gionis; Stefano Leonardi; |
2012 | 11 | Echoes Of Power: Language Effects And Power Differences In Social Interaction IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Starting from this observation, we propose an analysis framework based on linguistic coordination that can be used to shed light on power relationships and that works consistently across multiple types of power — including a more "static" form of power based on status differences, and a more "situational" form of power in which one individual experiences a type of dependence on another. |
Cristian Danescu-Niculescu-Mizil; Lillian Lee; Bo Pang; Jon Kleinberg; |
2012 | 12 | Estimating The Prevalence Of Deception In Online Review Communities IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a generative model of deception which, in conjunction with a deception classifier, we use to explore the prevalence of deception in six popular online review communities: Expedia, Hotels.com, Orbitz, Priceline, TripAdvisor, and Yelp. |
Myle Ott; Claire Cardie; Jeff Hancock; |
2012 | 13 | Serf And Turf: Crowdturfing For Fun And Profit IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe in this paper a significant effort to study and understand these "crowdturfing" systems in today’s Internet. |
GANG WANG et. al. |
2012 | 14 | YouTube Around The World: Geographic Popularity Of Videos IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work we study the relationship between popularity and locality of online YouTube videos. |
Anders Brodersen; Salvatore Scellato; Mirjam Wattenhofer; |
2012 | 15 | We Know What @you #tag: Does The Dual Role Affect Hashtag Adoption? IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose comprehensive measures to quantify the major factors of how a user selects content tags as well as joins communities. |
Lei Yang; Tao Sun; Ming Zhang; Qiaozhu Mei; |
2011 | 1 | Information Credibility On Twitter IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: On this paper we focus on automatic methods for assessing the credibility of a given set of tweets. |
Carlos Castillo; Marcelo Mendoza; Barbara Poblete; |
2011 | 2 | Differences In The Mechanics Of Information Diffusion Across Topics: Idioms, Political Hashtags, And Complex Contagion On Twitter IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here we study this issue on Twitter, analyzing the ways in which tokens known as hashtags spread on a network defined by the interactions among Twitter users. |
Daniel M. Romero; Brendan Meeder; Jon Kleinberg; |
2011 | 3 | Who Says What To Whom On Twitter IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We study several longstanding questions in media communications research, in the context of the microblogging service Twitter, regarding the production, flow, and consumption of information. |
Shaomei Wu; Jake M. Hofman; Winter A. Mason; Duncan J. Watts; |
2011 | 4 | Limiting The Spread Of Misinformation In Social Networks IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we study the notion of competing campaigns in a social network and address the problem of influence limitation where a "bad" campaign starts propagating from a certain node in the network and use the notion of limiting campaigns to counteract the effect of misinformation. |
Ceren Budak; Divyakant Agrawal; Amr El Abbadi; |
2011 | 5 | Layered Label Propagation: A Multiresolution Coordinate-free Ordering For Compressing Social Networks IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a solution that mixes clusterings and orders, and devise a new algorithm, called Layered Label Propagation, that builds on previous work on scalable clustering and can be used to reorder very large graphs (billions of nodes). |
Paolo Boldi; Marco Rosa; Massimo Santini; Sebastiano Vigna; |
2011 | 6 | Efficient K-nearest Neighbor Graph Construction For Generic Similarity Measures IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present NN-Descent, a simple yet efficient algorithm for approximate K-NNG construction with arbitrary similarity measures. |
Wei Dong; Charikar Moses; Kai Li; |
2011 | 7 | A Word At A Time: Computing Word Relatedness Using Temporal Semantic Analysis IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a new semantic relatedness model, Temporal Semantic Analysis (TSA), which captures this temporal information. |
Kira Radinsky; Eugene Agichtein; Evgeniy Gabrilovich; Shaul Markovitch; |
2011 | 8 | Counting Triangles And The Curse Of The Last Reducer IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our contributions are twofold. |
Siddharth Suri; Sergei Vassilvitskii; |
2011 | 9 | EP-SPARQL: A Unified Language For Event Processing And Stream Reasoning IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To bridge the gap, we propose Event Processing SPARQL (EP-SPARQL) as a new language for complex events and Stream Reasoning. We provide an open-source prototype implementation and present a set of tests to show the usefulness and effectiveness of our approach. |
Darko Anicic; Paul Fodor; Sebastian Rudolph; Nenad Stojanovic; |
2011 | 10 | Like Like Alike: Joint Friendship And Interest Propagation In Social Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we show that the information contained in interest networks (i.e. user-service interactions) and friendship networks (i.e. user-user connections) is highly correlated and mutually helpful. |
SHUANG-HONG YANG et. al. |
2011 | 11 | Prophiler: A Fast Filter For The Large-scale Detection Of Malicious Web Pages IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we describe the design and implementation of such a filter. |
Davide Canali; Marco Cova; Giovanni Vigna; Christopher Kruegel; |
2011 | 12 | Geographical Topic Discovery And Comparison IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we are interested in two questions: (1) how to discover different topics of interests that are coherent in geographical regions? To make a fair comparison, we collect several representative datasets from Flickr website including Landscape, Activity, Manhattan, National park, Festival, Car, and Food. |
Zhijun Yin; Liangliang Cao; Jiawei Han; Chengxiang Zhai; Thomas Huang; |
2011 | 13 | Automatic Construction Of A Context-aware Sentiment Lexicon: An Optimization Approach IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a novel optimization framework that provides a unified and principled way to combine different sources of information for learning such a context-dependent sentiment lexicon. |
Yue Lu; Malu Castellanos; Umeshwar Dayal; ChengXiang Zhai; |
2011 | 14 | Context-sensitive Query Auto-completion IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user’s input that are most similar to the context queries. |
Ziv Bar-Yossef; Naama Kraus; |
2011 | 15 | Mark My Words!: Linguistic Style Accommodation In Social Media IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To investigate this, we develop a probabilistic framework that can model accommodation and measure its effects. |
Cristian Danescu-Niculescu-Mizil; Michael Gamon; Susan Dumais; |
2010 | 1 | What Is Twitter, A Social Network Or A News Media? IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: The goal of this paper is to study the topological characteristics of Twitter and its power as a new medium of information sharing. |
Haewoon Kwak; Changhyun Lee; Hosung Park; Sue Moon; |
2010 | 2 | Earthquake Shakes Twitter Users: Real-time Event Detection By Social Sensors IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: As described in this paper, we investigate the real-time interaction of events such as earthquakes in Twitter and propose an algorithm to monitor tweets and to detect a target event. |
Takeshi Sakaki; Makoto Okazaki; Yutaka Matsuo; |
2010 | 3 | A Contextual-bandit Approach To Personalized News Article Recommendation IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we model personalized recommendation of news articles as a contextual bandit problem, a principled approach in which a learning algorithm sequentially selects articles to serve users based on contextual information about the users and articles, while simultaneously adapting its article-selection strategy based on user-click feedback to maximize total user clicks. |
Lihong Li; Wei Chu; John Langford; Robert E. Schapire; |
2010 | 4 | Factorizing Personalized Markov Chains For Next-basket Recommendation IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a method bringing both approaches together. |
Steffen Rendle; Christoph Freudenthaler; Lars Schmidt-Thieme; |
2010 | 5 | Predicting Positive And Negative Links In Online Social Networks IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or antagonism). |
Jure Leskovec; Daniel Huttenlocher; Jon Kleinberg; |
2010 | 6 | Empirical Comparison Of Algorithms For Network Community Detection IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we explore a range of network community detection methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. |
Jure Leskovec; Kevin J. Lang; Michael Mahoney; |
2010 | 7 | Web-scale K-means Clustering IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web applications. |
D. Sculley; |
2010 | 8 | Cross-domain Sentiment Classification Via Spectral Feature Alignment IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this cross-domain sentiment classification setting, to bridge the gap between the domains, we propose a spectral feature alignment (SFA) algorithm to align domain-specific words from different domains into unified clusters, with the help of domain-independent words as a bridge. |
Sinno Jialin Pan; Xiaochuan Ni; Jian-Tao Sun; Qiang Yang; Zheng Chen; |
2010 | 9 | Find Me If You Can: Improving Geographical Prediction With Social And Spatial Proximity IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Using these measurements, we introduce an algorithm that predicts the location of an individual from a sparse set of located users with performance that exceeds IP-based geolocation. |
Lars Backstrom; Eric Sun; Cameron Marlow; |
2010 | 10 | Modeling Relationship Strength In Online Social Networks IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we develop an unsupervised model to estimate relationship strength from interaction activity (e.g., communication, tagging) and user similarity. |
Rongjing Xiang; Jennifer Neville; Monica Rogati; |
2010 | 11 | Detection And Analysis Of Drive-by-download Attacks And Malicious JavaScript Code IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents a novel approach to the detection and analysis of malicious JavaScript code. |
Marco Cova; Christopher Kruegel; Giovanni Vigna; |
2010 | 12 | Collaborative Location And Activity Recommendations With GPS History Data IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we show that, by using the location data based on GPS and users’ comments at various locations, we can discover interesting locations and possible activities that can be performed there for recommendations. |
Vincent W. Zheng; Yu Zheng; Xing Xie; Qiang Yang; |
2010 | 13 | The Anatomy Of A Large-scale Social Search Engine IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present Aardvark, a social search engine. |
Damon Horowitz; Sepandar D. Kamvar; |
2010 | 14 | Selecting Skyline Services For QoS-based Web Service Composition IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose an approach based on the notion of skyline to effectively and efficiently select services for composition, reducing the number of candidate services to be considered. |
Mohammad Alrifai; Dimitrios Skoutas; Thomas Risse; |
2010 | 15 | Privacy Wizards For Social Networking Sites IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a template for the design of a social networking privacy wizard. To evaluate our approach, we collected detailed privacy preference data from 45 real Facebook users. |
Lujun Fang; Kristen LeFevre; |
2009 | 1 | Mining Interesting Locations And Travel Sequences From GPS Trajectories IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, based on multiple users’ GPS trajectories, we aim to mine interesting locations and classical travel sequences in a given geospatial region. |
Yu Zheng; Lizhu Zhang; Xing Xie; Wei-Ying Ma; |
2009 | 2 | Mapping The World’s Photos IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We investigate how to organize a large collection of geotagged photos, working with a dataset of about 35 million images collected from Flickr. |
David J. Crandall; Lars Backstrom; Daniel Huttenlocher; Jon Kleinberg; |
2009 | 3 | A Measurement-driven Analysis Of Information Propagation In The Flickr Social Network IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we collect and analyze large-scale traces of information dissemination in the Flickr social network. |
Meeyoung Cha; Alan Mislove; Krishna P. Gummadi; |
2009 | 4 | Combining Global Optimization With Local Selection For Efficient QoS-aware Service Composition IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we address this problem and propose a solution that combines global optimization with local selection techniques to benefit from the advantages of both worlds. |
Mohammad Alrifai; Thomas Risse; |
2009 | 5 | All Your Contacts Are Belong To Us: Automated Identity Theft Attacks On Social Networks IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we investigate how easy it would be for a potential attacker to launch automated crawling and identity theft attacks against a number of popular social networking sites in order to gain access to a large volume of personal user information. |
Leyla Bilge; Thorsten Strufe; Davide Balzarotti; Engin Kirda; |
2009 | 6 | To Join Or Not To Join: The Illusion Of Privacy In Social Networks With Mixed Public And Private User Profiles IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. |
Elena Zheleva; Lise Getoor; |
2009 | 7 | A Dynamic Bayesian Network Click Model For Web Search Ranking IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a Dynamic Bayesian Network which aims at providing us with unbiased estimation of the relevance from the click logs. |
Olivier Chapelle; Ya Zhang; |
2009 | 8 | Tag Ranking IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a tag ranking scheme, aiming to automatically rank the tags associated with a given image according to their relevance to the image content. |
Dong Liu; Xian-Sheng Hua; Linjun Yang; Meng Wang; Hong-Jiang Zhang; |
2009 | 9 | The Slashdot Zoo: Mining A Social Network With Negative Edges IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We adapt social network analysis techniques to the problem of negative edge weights. |
Jérôme Kunegis; Andreas Lommatzsch; Christian Bauckhage; |
2009 | 10 | An Axiomatic Approach For Result Diversification IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We conduct a large scale evaluation of our objectives based on two data sets: a data set derived from the Wikipedia disambiguation pages and a product database. We develop a set of natural axioms that a diversification system is expected to satisfy, and show that no diversification function can satisfy all the axioms simultaneously. |
Sreenivas Gollapudi; Aneesh Sharma; |
2009 | 11 | Rated Aspect Summarization Of Short Comments IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study the problem of generating a “rated aspect summary” of short comments, which is a decomposed view of the overall ratings for the major aspects so that a user could gain different perspectives towards the target entity. |
Yue Lu; ChengXiang Zhai; Neel Sundaresan; |
2009 | 12 | How Much Can Behavioral Targeting Help Online Advertising? IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To answer this question, in this paper we provide an empirical study on the click-through log of advertisements collected from a commercial search engine. |
JUN YAN et. al. |
2009 | 13 | Evaluating Similarity Measures For Emergent Semantics Of Social Tagging IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Here we build an evaluation framework to compare various general folksonomy-based similarity measures, which are derived from several established information-theoretic, statistical, and practical measures. |
BENJAMIN MARKINES et. al. |
2009 | 14 | Triplify: Light-weight Linked Data Publication From Relational Databases IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we present Triplify – a simplistic but effective approach to publish Linked Data from relational databases. |
Sören Auer; Sebastian Dietzold; Jens Lehmann; Sebastian Hellmann; David Aumueller; |
2009 | 15 | Tagommenders: Connecting Users To Items Through Tags IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we explore tagommenders, recommender algorithms that predict users’ preferences for items based on their inferred preferences for tags. |
Shilad Sen; Jesse Vig; John Riedl; |
2008 | 1 | Flickr Tag Recommendation Based On Collective Knowledge IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we investigate how we can assist users in the tagging phase. |
Börkur Sigurbjörnsson; Roelof van Zwol; |
2008 | 2 | Statistical Properties Of Community Structure In Large Social And Information Networks IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we characterize as a function of size the statistical and structural properties of such sets of nodes. |
Jure Leskovec; Kevin J. Lang; Anirban Dasgupta; Michael W. Mahoney; |
2008 | 3 | Knowledge Sharing And Yahoo Answers: Everyone Knows Something IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we seek to understand YA’s knowledge sharing and activity. |
Lada A. Adamic; Jun Zhang; Eytan Bakshy; Mark S. Ackerman; |
2008 | 4 | Modeling Online Reviews With Multi-grain Topic Models IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we present a novel framework for extracting the ratable aspects of objects from online user reviews. |
Ivan Titov; Ryan McDonald; |
2008 | 5 | Planetary-scale Views On A Large Instant-messaging Network IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft Messenger instant-messaging system. |
Jure Leskovec; Eric Horvitz; |
2008 | 6 | Learning Transportation Mode From Raw Gps Data For Geographic Applications On The Web IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, an approach based on supervised learning is proposed to automatically infer transportation mode from raw GPS data. |
Yu Zheng; Like Liu; Longhao Wang; Xing Xie; |
2008 | 7 | Investigating Web Services On The World Wide Web IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work, we conduct a thorough analytical investigation on the plurality of Web service interfaces that exist on the Web today. |
Eyhab Al-Masri; Qusay H. Mahmoud; |
2008 | 8 | Video Suggestion And Discovery For Youtube: Taking Random Walks Through The View Graph IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a novel method based upon the analysis of the entire user-video graph to provide personalized video suggestions for users. |
SHUMEET BALUJA et. al. |
2008 | 9 | Supporting Anonymous Location Queries In Mobile Environments With Privacygrid IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents PrivacyGrid – a framework for supporting anonymous location-based queries in mobile information delivery systems. |
Bhuvan Bamba; Ling Liu; Peter Pesti; Ting Wang; |
2008 | 10 | Generating Diverse And Representative Image Search Results For Landmarks IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present an approach to extracting tags that represent landmarks. |
Lyndon S. Kennedy; Mor Naaman; |
2008 | 11 | Facetnet: A Framework For Analyzing Communities And Their Evolutions In Dynamic Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose FacetNet for analyzing communities and their evolutions through a robust unified process. |
Yu-Ru Lin; Yun Chi; Shenghuo Zhu; Hari Sundaram; Belle L. Tseng; |
2008 | 12 | Topic Modeling With Network Regularization IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we formally define the problem of topic modeling with network structure (TMN). |
Qiaozhu Mei; Deng Cai; Duo Zhang; ChengXiang Zhai; |
2008 | 13 | Tag-based Social Interest Discovery IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a novel social interest discovery approach based on user-generated tags. |
Xin Li; Lei Guo; Yihong Eric Zhao; |
2008 | 14 | Optimal Marketing Strategies Over Social Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In the general case, motivated by hardness results, we investigate approximation algorithms for this problem. |
Jason Hartline; Vahab Mirrokni; Mukund Sundararajan; |
2008 | 15 | Automatically Refining The Wikipedia Infobox Ontology IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper introduces KOG, an autonomous system for refining Wikipedia’s infobox-class ontology towards this end. |
Fei Wu; Daniel S. Weld; |
2007 | 1 | Yago: A Core Of Semantic Knowledge IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present YAGO, a light-weight and extensible ontology with high coverage and quality. |
Fabian M. Suchanek; Gjergji Kasneci; Gerhard Weikum; |
2007 | 2 | Google News Personalization: Scalable Online Collaborative Filtering IF:10 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we describe our approach to collaborative filtering for generating personalized recommendations for users of Google News. |
Abhinandan S. Das; Mayur Datar; Ashutosh Garg; Shyam Rajaram; |
2007 | 3 | Predicting Clicks: Estimating The Click-through Rate For New Ads IF:10 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We show that we can use features of ads, terms, and advertisers to learn a model that accurately predicts the click-though rate for new ads. |
Matthew Richardson; Ewa Dominowska; Robert Ragno; |
2007 | 4 | A Large-scale Study Of Web Password Habits IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We report the results of a large scale study of password use andpassword re-use habits. |
Dinei Florencio; Cormac Herley; |
2007 | 5 | Analysis Of Topological Characteristics Of Huge Online Social Networking Services IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. |
Yong-Yeol Ahn; Seungyeop Han; Haewoon Kwak; Sue Moon; Hawoong Jeong; |
2007 | 6 | Cantina: A Content-based Approach To Detecting Phishing Web Sites IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present the design, implementation, and evaluation of CANTINA, a novel, content-based approach to detecting phishing web sites, based on the TF-IDF information retrieval algorithm. |
Yue Zhang; Jason I. Hong; Lorrie F. Cranor; |
2007 | 7 | Expertise Networks In Online Communities: Structure And Algorithms IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this study, we analyze the Java Forum, a large online help-seeking community, using social network analysis methods. |
Jun Zhang; Mark S. Ackerman; Lada Adamic; |
2007 | 8 | Topic Sentiment Mixture: Modeling Facets And Opinions In Weblogs IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we define the problem of topic-sentiment analysis on Weblogs and propose a novel probabilistic model to capture the mixture of topics and sentiments simultaneously. |
Qiaozhu Mei; Xu Ling; Matthew Wondra; Hang Su; ChengXiang Zhai; |
2007 | 9 | Wherefore Art Thou R3579x?: Anonymized Social Networks, Hidden Patterns, And Structural Steganography IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe a family of attacks such that even from a single anonymized copy of a social network, it is possible for an adversary to learn whether edges exist or not between specific targeted pairs of nodes. |
Lars Backstrom; Cynthia Dwork; Jon Kleinberg; |
2007 | 10 | Scaling Up All Pairs Similarity Search IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a simple algorithm based on novel indexing and optimization strategies that solves this problem without relying on approximation methods or extensive parameter tuning. |
Roberto J. Bayardo; Yiming Ma; Ramakrishnan Srikant; |
2007 | 11 | Learning To Detect Phishing Emails IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a method for detecting these attacks, which in its most general form is an application of machine learning on a feature set designed to highlight user-targeted deception in electronic communication. |
Ian Fette; Norman Sadeh; Anthony Tomasic; |
2007 | 12 | The Complex Dynamics Of Collaborative Tagging IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper uses data from the social bookmarking site delicio. |
Harry Halpin; Valentin Robu; Hana Shepherd; |
2007 | 13 | A Large-scale Evaluation And Analysis Of Personalized Search Strategies IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study this problem and get some preliminary conclusions. |
Zhicheng Dou; Ruihua Song; Ji-Rong Wen; |
2007 | 14 | Detecting Near-duplicates For Web Crawling IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Two such documents differ from each other in a very small portion that displays advertisements, for example. |
Gurmeet Singh Manku; Arvind Jain; Anish Das Sarma; |
2007 | 15 | Optimizing Web Search Using Social Annotations IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Two novel algorithms are proposed to incorporate the above information into page ranking: 1) SocialSimRank (SSR)calculates the similarity between social annotations and webqueries; 2) SocialPageRank (SPR) captures the popularity of webpages. |
SHENGHUA BAO et. al. |
2006 | 1 | A Web-based Kernel Function For Measuring The Similarity Of Short Text Snippets IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we define such a similarity kernel function, mathematically analyze some of its properties, and provide examples of its efficacy. |
Mehran Sahami; Timothy D. Heilman; |
2006 | 2 | Generating Query Substitutions IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We introduce the notion of query substitution, that is, generating a new query to replace a user’s original search query. |
Rosie Jones; Benjamin Rey; Omid Madani; Wiley Greiner; |
2006 | 3 | Detecting Spam Web Pages Through Content Analysis IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we continue our investigations of "web spam": the injection of artificially-created pages into the web in order to influence the results from search engines, to drive traffic to certain pages for fun or profit. |
Alexandros Ntoulas; Marc Najork; Mark Manasse; Dennis Fetterly; |
2006 | 4 | Semantic Wikipedia IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: Wikipedia is the world’s largest collaboratively edited source of encyclopaedic knowledge. But in spite of its utility, its contents are barely machine-interpretable. Structural … |
Max Völkel; Markus Krötzsch; Denny Vrandecic; Heiko Haller; Rudi Studer; |
2006 | 5 | Automatic Identification Of User Interest For Personalized Search IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we study how a search engine can learn a user’s preference automatically based on her past click history and how it can use the user preference to personalize search results. |
Feng Qiu; Junghoo Cho; |
2006 | 6 | Exploring Social Annotations For The Semantic Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we explore a complement approach that focuses on the "social annotations of the web" which are annotations manually made by normal web users without a pre-defined formal ontology. |
Xian Wu; Lei Zhang; Yong Yu; |
2006 | 7 | Knowing The User’s Every Move: User Activity Tracking For Website Usability Evaluation And Implicit Interaction IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we investigate how detailed tracking of user interaction can be monitored using standard web technologies. |
Richard Atterer; Monika Wnuk; Albrecht Schmidt; |
2006 | 8 | Finding Advertising Keywords On Web Pages IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe a system that learns how to extract keywords from web pages for advertisement targeting. |
Wen-tau Yih; Joshua Goodman; Vitor R. Carvalho; |
2006 | 9 | Improved Annotation Of The Blogosphere Via Autotagging And Hierarchical Clustering IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We analyze the effectiveness of tags for classifying blog entries by gathering the top 350 tags from Technorati and measuring the similarity of all articles that share a tag. |
Christopher H. Brooks; Nancy Montanez; |
2006 | 10 | A Probabilistic Approach To Spatiotemporal Theme Pattern Mining On Weblogs IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we define the novel problem of mining spatiotemporal theme patterns from weblogs and propose a novel probabilistic approach to model the subtopic themes and spatiotemporal theme patterns simultaneously. |
Qiaozhu Mei; Chao Liu; Hang Su; ChengXiang Zhai; |
2006 | 11 | POLYPHONET: An Advanced Social Network Extraction System From The Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose a social network extraction system called POLYPHONET, which employs several advanced techniques to extract relations of persons, detect groups of persons, and obtain keywords for a person. |
YUTAKA MATSUO et. al. |
2006 | 12 | Visualizing Tags Over Time IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a new approach based on a characterization of the most interesting tags associated with a sliding interval of time. |
MICAH DUBINKO et. al. |
2006 | 13 | Web Ontology Segmentation: Analysis, Classification And Use IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present and evaluate several algorithms for extracting relevant segments out of large description logic ontologies for the purposes of increasing tractability for both humans and computers. |
Julian Seidenberg; Alan Rector; |
2006 | 14 | SecuBat: A Web Vulnerability Scanner IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To this end, we developed SecuBat, a generic and modular web vulnerability scanner that, similar to a port scanner, automatically analyzes web sites with the aim of finding exploitable SQL injection and XSS vulnerabilities. |
Stefan Kals; Engin Kirda; Christopher Kruegel; Nenad Jovanovic; |
2006 | 15 | Large-scale Text Categorization By Batch Mode Active Learning IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a novel active learning algorithm that selects a batch of text documents for labeling manually in each iteration. |
Steven C. H. Hoi; Rong Jin; Michael R. Lyu; |
2005 | 1 | Opinion Observer: Analyzing And Comparing Opinions On The Web IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper focuses on online customer reviews of products. |
Bing Liu; Minqing Hu; Junsheng Cheng; |
2005 | 2 | Improving Recommendation Lists Through Topic Diversification IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this work we present topic diversification, a novel method designed to balance and diversify personalized recommendation lists in order to reflect the user’s complete spectrum of interests. |
Cai-Nicolas Ziegler; Sean M. McNee; Joseph A. Konstan; Georg Lausen; |
2005 | 3 | Web Data Extraction Based On Partial Tree Alignment IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper proposes a new method to perform the task automatically. |
Yanhong Zhai; Bing Liu; |
2005 | 4 | Named Graphs, Provenance And Trust IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: The extension of RDF to Named Graphs provides a formally defined framework to be a foundation for the Semantic Web trust layer. |
Jeremy J. Carroll; Christian Bizer; Pat Hayes; Patrick Stickler; |
2005 | 5 | Automatic Identification Of User Goals In Web Search IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we study whether and how we can automate this goal-identification process. |
Uichin Lee; Zhenyu Liu; Junghoo Cho; |
2005 | 6 | LSH Forest: Self-tuning Indexes For Similarity Search IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose an indexing scheme called LSH Forest which is applicable in all the above contexts. |
Mayank Bawa; Tyson Condie; Prasanna Ganesan; |
2005 | 7 | CubeSVD: A Novel Approach To Personalized Web Search IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, a novel approach CubeSVD is proposed to improve Web search. |
Jian-Tao Sun; Hua-Jun Zeng; Huan Liu; Yuchang Lu; Zheng Chen; |
2005 | 8 | Fully Automatic Wrapper Generation For Search Engines IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we present a technique for automatically producing wrappers that can be used to extract search result records from dynamically generated result pages returned by search engines. |
Hongkun Zhao; Weiyi Meng; Zonghuan Wu; Vijay Raghavan; Clement Yu; |
2005 | 9 | Thresher: Automating The Unwrapping Of Semantic Content From The World Wide Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe Thresher, a system that lets non-technical users teach their browsers how to extract semantic web content from HTML documents on the World Wide Web. |
Andrew Hogue; David Karger; |
2005 | 10 | TrustGuard: Countering Vulnerabilities In Reputation Management For Decentralized Overlay Networks IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we identify three vulnerabilities that are detrimental to decentralized reputation management and propose TrustGuard – a safeguard framework for providing a highly dependable and yet efficient reputation system. First, we provide a dependable trust model and a set of formal methods to handle strategic malicious nodes that continuously change their behavior to gain unfair advantages in the system. |
Mudhakar Srivatsa; Li Xiong; Ling Liu; |
2005 | 11 | Object-level Ranking: Bringing Order To Web Objects IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper introduces PopRank, a domain-independent object-level link analysis model to rank the objects within a specific domain. |
Zaiqing Nie; Yuanzhi Zhang; Ji-Rong Wen; Wei-Ying Ma; |
2005 | 12 | Disambiguating Web Appearances Of People In A Social Network IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents two unsupervised frameworks for solving this problem: one based on link structure of the Web pages, another using Agglomerative/Conglomerative Double Clustering (A/CDC)—an application of a recently introduced multi-way distributional clustering method. To evaluate our methods, we collected and hand-labeled a dataset of over 1000 Web pages retrieved from Google queries on 12 personal names appearing together in someones in an email folder. |
Ron Bekkerman; Andrew McCallum; |
2005 | 13 | SemRank: Ranking Complex Relationship Search Results On The Semantic Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently … |
Kemafor Anyanwu; Angela Maduko; Amit Sheth; |
2005 | 14 | Static Approximation Of Dynamically Generated Web Pages IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: The approximation obtained by the analyzer can be used to check various properties of a server-side program and the pages it generates.To demonstrate the effectiveness of the analysis, we have implemented a string analyzer for the server-side scripting language PHP. |
Yasuhiko Minamide; |
2005 | 15 | Debugging OWL Ontologies IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: These cues, in conjunction with extensive undo/redo and Annotea based collaboration support in Swoop, significantly improve the OWL debugging experience, and point the way to more general improvements in the presentation of an ontology to new users. |
Bijan Parsia; Evren Sirin; Aditya Kalyanpur; |
2004 | 1 | Propagation Of Trust And Distrust IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We develop a framework of trust propagation schemes, each of which may be appropriate in certain circumstances, and evaluate the schemes on a large trust network consisting of 800K trust scores expressed among 130K people. |
R. Guha; Ravi Kumar; Prabhakar Raghavan; Andrew Tomkins; |
2004 | 2 | Information Diffusion Through Blogspace IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose, validate, and employ an algorithm to induce the underlying propagation network from a sequence of posts, and report on the results. |
Daniel Gruhl; R. Guha; David Liben-Nowell; Andrew Tomkins; |
2004 | 3 | The Webgraph Framework I: Compression Techniques IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other). |
P. Boldi; S. Vigna; |
2004 | 4 | Understanding User Goals In Web Search IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we describe a framework for understanding the underlying goals of user searches, and our experience in using the framework to manually classify queries from a web search engine. |
Daniel E. Rose; Danny Levinson; |
2004 | 5 | Web-scale Information Extraction In Knowitall: (preliminary Results) IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: The paper analyzes KnowItAll’s architecture and reports on lessons learned for the design of large-scale information extraction systems. |
OREN ETZIONI et. al. |
2004 | 6 | Accurate, Scalable In-network Identification Of P2p Traffic Using Application Signatures IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our measurements show thatour technique achieves less than 5% false positive and false negative ratios in most cases. |
Subhabrata Sen; Oliver Spatscheck; Dongmei Wang; |
2004 | 7 | Adaptive Web Search Based On User Profile Constructed Without Any Effort From Users IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: Web search engines help users find useful information on the World Wide Web (WWW). However, when the same query is submitted by different users, typical search engines return the … |
Kazunari Sugiyama; Kenji Hatano; Masatoshi Yoshikawa; |
2004 | 8 | Analysis Of Interacting BPEL Web Services IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a framework where BPEL specifications of web services are translated to an intermediate representation, followed by the translation of the intermediate representation to a verification language. This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML messages. |
Xiang Fu; Tevfik Bultan; Jianwen Su; |
2004 | 9 | Shilling Recommender Systems For Fun And Profit IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper explores four open questions that may affect the effectiveness of such shilling attacks: which recommender algorithm is being used, whether the application is producing recommendations or predictions, how detectable the attacks are by the operator of the system, and what the properties are of the items being attacked. |
Shyong K. Lam; John Riedl; |
2004 | 10 | Securing Web Application Code By Static Analysis And Runtime Protection IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we describe a sound and holistic approach to ensuring Web application security. |
YAO-WEN HUANG et. al. |
2004 | 11 | Meteor-s Web Service Annotation Framework IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we present MWSAF (METEOR-S Web Service Annotation Framework), a framework for semi-automatically marking up Web service descriptions with ontologies. |
Abhijit A. Patil; Swapna A. Oundhakar; Amit P. Sheth; Kunal Verma; |
2004 | 12 | What’s New On The Web?: The Evolution Of The Web From A Search Engine Perspective IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We seek to gain improved insight into how Web search engines shouldcope with the evolving Web, in an attempt to provide users with themost up-to-date results possible. |
Alexandros Ntoulas; Junghoo Cho; Christopher Olston; |
2004 | 13 | Towards The Self-annotating Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper wepropose PANKOW (Pattern-based Annotation through Knowledge on theWeb), a method which employs an unsupervised, pattern-based approach to categorize instances with regard to an ontology. |
Philipp Cimiano; Siegfried Handschuh; Steffen Staab; |
2004 | 14 | A Hybrid Approach For Searching In The Semantic Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper presents a search architecture that combines classical search techniques with spread activation techniques applied to a semantic model of a given domain. |
Cristiano Rocha; Daniel Schwabe; Marcus Poggi Aragao; |
2004 | 15 | Automatic Web News Extraction Using Tree Edit Distance IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Major efforts have been made in order to provide efficient access to relevant information within this huge repository of data. |
D. C. Reis; P. B. Golgher; A. S. Silva; A. F. Laender; |
2003 | 1 | The Eigentrust Algorithm For Reputation Management In P2P Networks IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a distributed and secure method to compute global trust values, based on Power iteration. |
Sepandar D. Kamvar; Mario T. Schlosser; Hector Garcia-Molina; |
2003 | 2 | Mining The Peanut Gallery: Opinion Extraction And Semantic Classification Of Product Reviews IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We begin by identifying the unique properties of this problem and develop a method for automatically distinguishing between positive and negative reviews. |
Kushal Dave; Steve Lawrence; David M. Pennock; |
2003 | 3 | Scaling Personalized Web Search IF:10 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present new graph-theoretical results, and a new technique based on these results, that encode personalized views as partial vectors. |
Glen Jeh; Jennifer Widom; |
2003 | 4 | Quality Driven Web Services Composition IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we advocate that the selection of component services should be carried out during the execution of a composite service, rather than at design-time. |
Liangzhao Zeng; Boualem Benatallah; Marlon Dumas; Jayant Kalagnanam; Quan Z. Sheng; |
2003 | 5 | Description Logic Programs: Combining Logic Programs With Description Logic IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. |
Benjamin N. Grosof; Ian Horrocks; Raphael Volz; Stefan Decker; |
2003 | 6 | A Software Framework For Matchmaking Based On Semantic Web Technology IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In particular, we describe the design and implementation of a service matchmaking prototype which uses a DAML-S based ontology and a Description Logic reasoner to compare ontology based service descriptions. |
Lei Li; Ian Horrocks; |
2003 | 7 | Semantic Search IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we present an application called ‘Semantic Search’ which is built on these supporting technologies and is designed to improve traditional web searching. |
R. Guha; Rob McCool; Eric Miller; |
2003 | 8 | On The Bursty Evolution Of Blogspace IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We propose two new tools to address the evolution of hyperlinked corpora. |
Ravi Kumar; Jasmine Novak; Prabhakar Raghavan; Andrew Tomkins; |
2003 | 9 | SemTag And Seeker: Bootstrapping The Semantic Web Via Automated Semantic Annotation IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper describes Seeker, a platform for large-scale text analytics, and SemTag, an application written on the platform to perform automated semantic tagging of large corpora. |
STEPHEN DILL et. al. |
2003 | 10 | Extrapolation Methods For Accelerating PageRank Computations IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the ”importance” of Web pages. |
Sepandar D. Kamvar; Taher H. Haveliwala; Christopher D. Manning; Gene H. Golub; |
2003 | 11 | A Large-scale Study Of The Evolution Of Web Pages IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We found that the average degree of change varies widely across top-level domains, and that larger pages change more often and more severely than smaller ones.This paper describes the crawl and the data transformations we performed on the logs, and presents some statistical observations on the degree of change of different classes of pages. |
Dennis Fetterly; Mark Manasse; Marc Najork; Janet Wiener; |
2003 | 12 | Web Application Security Assessment By Fault Injection And Behavior Monitoring IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe the use of a number of software-testing techniques (including dynamic analysis, black-box testing, fault injection, and behavior monitoring), and suggest mechanisms for applying these techniques to Web applications. |
Yao-Wen Huang; Shih-Kun Huang; Tsung-Po Lin; Chung-Hung Tsai; |
2003 | 13 | Data Extraction And Label Assignment For Web Databases IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we describe a system called, DeLa, which reconstructs (part of) a "hidden" back-end web database. |
Jiying Wang; Fred H. Lochovsky; |
2003 | 14 | Conversation Specification: A New Approach To Design And Analysis Of E-service Composition IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. |
Tevfik Bultan; Xiang Fu; Richard Hull; Jianwen Su; |
2003 | 15 | DOM-based Content Extraction Of HTML Documents IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our key insight is to work with the DOM trees, rather than with raw HTML markup. |
Suhit Gupta; Gail Kaiser; David Neistadt; Peter Grimm; |
2002 | 1 | Topic-sensitive PageRank IF:10 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. |
Taher H. Haveliwala; |
2002 | 2 | Learning To Map Between Ontologies On The Semantic Web IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We describe a set of experiments on several real-world domains, and show that glue proposes highly accurate semantic mappings. |
AnHai Doan; Jayant Madhavan; Pedro Domingos; Alon Halevy; |
2002 | 3 | EDUTELLA: A P2P Networking Infrastructure Based On RDF IF:9 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we discuss the open source project Edutella which builds upon metadata standards defined for the WWW and aims to provide an RDF-based metadata infrastructure for P2P applications, building on the recently announced JXTA Framework. |
WOLFGANG NEJDL et. al. |
2002 | 4 | Simulation, Verification And Automated Composition Of Web Services IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Our objective is to enable markup and automated reasoning technology to describe, simulate, compose, test, and verify compositions of Web services. |
Srini Narayanan; Sheila A. McIlraith; |
2002 | 5 | Flash Crowds And Denial Of Service Attacks: Characterization And Implications For CDNs And Web Sites IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We therefore propose an enhancement to CDNs that offers better protection and use trace-driven simulations to study the effect of our enhancement on CDNs and Web sites. |
Jaeyeon Jung; Balachander Krishnamurthy; Michael Rabinovich; |
2002 | 6 | RQL: A Declarative Query Language For RDF IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper, we propose a new RDF query language called RQL. |
Gregory Karvounarakis; Sofia Alexaki; Vassilis Christophides; Dimitris Plexousakis; Michel Scholl; |
2002 | 7 | Probabilistic Query Expansion Using Query Logs IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this study, we propose a new method for query expansion based on query logs. |
Hang Cui; Ji-Rong Wen; Jian-Yun Nie; Wei-Ying Ma; |
2002 | 8 | Choosing Reputable Servents In A P2P Network IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: As recent experience with P2P environments such as Gnutella shows, anonymity opens the door to possible misuses and abuses by resource providers exploiting the network as a way to spread tampered with resources, including malicious programs, such as Trojan Horses and viruses.In this paper we propose an approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers. |
Fabrizio Cornelli; Ernesto Damiani; Sabrina De Capitani di Vimercati; Stefano Paraboschi; Pierangela Samarati; |
2002 | 9 | Parallel Crawlers IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: In this paper we study how we can design an effective parallel crawler. |
Junghoo Cho; Hector Garcia-Molina; |
2002 | 10 | Template Detection Via Data Mining And Its Applications IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We formulate and propose the template detection problem, and suggest a practical solution for it based on counting frequent item sets. |
Ziv Bar-Yossef; Sridhar Rajagopalan; |
2002 | 11 | Abstracting Application-level Web Security IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We (i) describe a scalable structuring mechanism facilitating the abstraction of security policies from large web-applications developed in heterogenous multi-platform environments; (ii) present a tool which assists programmers develop secure applications which are resilient to a wide range of common attacks; and (iii) report results and experience arising from our implementation of these techniques. |
David Scott; Richard Sharp; |
2002 | 12 | Using Web Structure For Classifying And Describing Web Pages IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: Results show that the text in citing documents, when available, often has greater discriminative and descriptive power than the text in the target document itself. |
Eric J. Glover; Kostas Tsioutsiouliklis; Steve Lawrence; David M. Pennock; Gary W. Flake; |
2002 | 13 | A Flexible Learning System For Wrapping Tables And Lists In HTML Documents IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a wrapper-learning system called WL2 that can exploit several different representations of a document. |
William W. Cohen; Matthew Hurst; Lee S. Jensen; |
2002 | 14 | Authoring And Annotation Of Web Pages In CREAM IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We discuss some of the requirements one has to meet when developing such an ontology-based framework, e.g. the integration of a metadata crawler, inference services, document management and a meta-ontology, and describe its implementation, viz. |
Siegfried Handschuh; Steffen Staab; |
2002 | 15 | Evaluating Strategies For Similarity Search On The Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Highlight: We present a technique for automatically evaluating strategies using Web hierarchies, such as Open Directory, in place of user feedback. |
Taher H. Haveliwala; Aristides Gionis; Dan Klein; Piotr Indyk; |
2001 | 1 | Item-based Collaborative Filtering Recommendation Algorithms IF:10 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Badrul Sarwar; George Karypis; Joseph Konstan; John Riedl; |
2001 | 2 | Clustering User Queries Of A Search Engine IF:8 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Ji-Rong Wen; Jian-Yun Nie; Hong-Jiang Zhang; |
2001 | 3 | Keys For XML IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Peter Buneman; Susan Davidson; Wenfei Fan; Carmem Hara; Wang-Chiew Tan; |
2001 | 4 | Scaling Question Answering To The Web IF:7 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Cody C. T. Kwok; Oren Etzioni; Daniel S. Weld; |
2001 | 5 | Adaptive Push-pull: Disseminating Dynamic Web Data IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Pavan Deolasee; Amol Katkar; Ankur Panchbudhe; Krithi Ramamritham; Prashant Shenoy; |
2001 | 6 | Intelligent Crawling On The World Wide Web With Arbitrary Predicates IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Charu C. Aggarwal; Fatima Al-Garawi; Philip S. Yu; |
2001 | 7 | Breadth-first Crawling Yields High-quality Pages IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Marc Najork; Janet L. Wiener; |
2001 | 8 | Geospatial Mapping And Navigation Of The Web IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Kevin S. McCurley; |
2001 | 9 | Segment-based Proxy Caching Of Multimedia Streams IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Kun-Lung Wu; Philip S. Yu; Joel L. Wolf; |
2001 | 10 | An Adaptive Model For Optimizing Performance Of An Incremental Web Crawler IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Jenny Edwards; Kevin McCurley; John Tomlin; |
2001 | 11 | Designing Personalized Web Applications IF:6 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Gustavo Rossi; Daniel Schwabe; Robson Guimarães; |
2001 | 12 | Integrating The Document Object Model With Hyperlinks For Enhanced Topic Distillation And Information Extraction IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Soumen Chakrabarti; |
2001 | 13 | Learning Search Engine Specific Query Transformations For Question Answering IF:5 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Eugene Agichtein; Steve Lawrence; Luis Gravano; |
2001 | 14 | LiteMinutes: An Internet-based System For Multimedia Meeting Minutes IF:4 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Patrick Chiu; John Boreczky; Andreas Girgensohn; Don Kimber; |
2001 | 15 | Web-based Personalization And Management Of Interactive Video IF:3 Related Papers Related Patents Related Grants Related Venues Related Experts View Abstract: No abstract available. … |
Rune Hjelsvold; Subu Vdaygiri; Yves Léauté; |