Sciweavers

22 search results - page 4 / 5
» Mining Implications from Lattices of Closed Trees
Sort
View
PKDD
2000
Springer
151views Data Mining» more  PKDD 2000»
13 years 10 months ago
Discovery of Characteristic subgraph Patterns Using Relative Indexing and the Cascade Model
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
Takashi Okada, Mayumi Oyama
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 8 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
13 years 4 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...
WWW
2009
ACM
13 years 11 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...
ICALP
2010
Springer
13 years 11 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin