Sciweavers

312 search results - page 57 / 63
» A General Divide and Conquer Approach for Process Mining
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 6 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
WWW
2009
ACM
15 years 11 months ago
Mapping the world's photos
We investigate how to organize a large collection of geotagged photos, working with a dataset of about 35 million images collected from Flickr. Our approach combines content analy...
David J. Crandall, Lars Backstrom, Daniel P. Hutte...
PKDD
2007
Springer
143views Data Mining» more  PKDD 2007»
15 years 5 months ago
Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
Sebastian Blohm, Philipp Cimiano
CIKM
2010
Springer
14 years 6 months ago
On bootstrapping recommender systems
Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more a...
Nadav Golbandi, Yehuda Koren, Ronny Lempel
67
Voted
WWW
2009
ACM
15 years 11 months ago
Rethinking email message and people search
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
Sebastian Michel, Ingmar Weber