Threading electronic mail: a preliminary study
Information Processing and Management: an International Journal - Special issue: methods and tools for the automatic construction of hypertext
Application of Spreading Activation Techniques in InformationRetrieval
Artificial Intelligence Review
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Large Margin Classification Using the Perceptron Algorithm
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Proceedings of the 11th international conference on World Wide Web
Pattern Recognition and Neural Networks
Pattern Recognition and Neural Networks
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
WWW '03 Proceedings of the 12th international conference on World Wide Web
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning random walk models for inducing word dependency distributions
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Dependency Networks for Relational Data
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
SemRank: ranking complex relationship search results on the semantic web
WWW '05 Proceedings of the 14th international conference on World Wide Web
Object-level ranking: bringing order to Web objects
WWW '05 Proceedings of the 14th international conference on World Wide Web
Ranking algorithms for named-entity extraction: boosting and the voted perceptron
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
SimFusion: measuring similarity using unified relationship matrix
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
On the collective classification of email "speech acts"
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Ranking and Reranking with Perceptron
Machine Learning
Query expansion using random walk models
Proceedings of the 14th ACM international conference on Information and knowledge management
A Network Analysis Model for Disambiguation of Names in Lists
Computational & Mathematical Organization Theory
Multi-way distributional clustering via pairwise interactions
ICML '05 Proceedings of the 22nd international conference on Machine learning
Learning to rank using gradient descent
ICML '05 Proceedings of the 22nd international conference on Machine learning
eMailSift: Email Classification Based on Structure and Content
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Machine Learning
An SVM based voting algorithm with application to parse reranking
CONLL '03 Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - Volume 4
Discriminative Reranking for Natural Language Parsing
Computational Linguistics
Email alias detection using social network analysis
Proceedings of the 3rd international workshop on Link discovery
Contextual search and name disambiguation in email using graphs
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Formal models for expert finding in enterprise corpora
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to rank networked entities
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Hierarchical Language Models for Expert Finding in Enterprise Corpora
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Joint learning improves semantic role labeling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Extracting personal names from email: applying named entity recognition to informal text
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
A shortest path dependency kernel for relation extraction
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Learning to rank typed graph walks: local and global approaches
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Journal of Artificial Intelligence Research
Learning probabilistic relational models
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Learning web page scores by error back-propagation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Topic and role discovery in social networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Transfer learning from minimal target data by mapping across relational domains
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Knowledge transfer on hybrid graph
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Ranking users for intelligent message addressing
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
Information Processing and Management: an International Journal
Exploring the corporate ecosystem with a semi-supervised entity graph
Proceedings of the 20th ACM international conference on Information and knowledge management
QBEES: query by entity examples
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Predicting relevant documents for enterprise communication contexts
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
Relational or semistructured data is naturally represented by a graph, where nodes denote entities and directed typed edges represent the relations between them. Such graphs are heterogeneous, describing different types of objects and links. We represent personal information as a graph that includes messages, terms, persons, dates, and other object types, and relations like sent-to and has-term. Given the graph, we apply finite random graph walks to induce a measure of entity similarity, which can be viewed as a tool for performing search in the graph. Experiments conducted using personal email collections derived from the Enron corpus and other corpora show how the different tasks of alias finding, threading, and person name disambiguation can be all addressed as search queries in this framework, where the graph-walk-based similarity metric is preferable to alternative approaches, and further improvements are achieved with learning. While researchers have suggested to tune edge weight parameters to optimize the graph walk performance per task, we apply reranking to improve the graph walk results, using features that describe high-level information such as the paths traversed in the walk. High performance, together with practical runtimes, suggest that the described framework is a useful search system in the PIM domain, as well as in other semistructured domains.