Sciweavers

11211 search results - page 317 / 2243
» Rank-Sensitive Data Structures
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 10 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
269
Voted
ACL
2003
15 years 8 months ago
A Ranking Model of Proximal and Structural Text Retrieval Based on Region Algebra
This paper investigates an application of the ranked region algebra to information retrieval from large scale but unannotated documents. We automatically annotated documents with ...
Katsuya Masuda
200
Voted
CIKM
2004
Springer
16 years 43 min ago
Organizing structured web sources by query schemas: a clustering approach
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 10 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
KDD
2010
ACM
277views Data Mining» more  KDD 2010»
15 years 10 months ago
Growing a tree in the forest: constructing folksonomies by integrating structured metadata
Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently to organize content hierarchically. These types of structured ...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor