Sciweavers

381 search results - page 40 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
NIPS
2000
13 years 9 months ago
High-temperature Expansions for Learning Models of Nonnegative Data
Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
Oliver B. Downs
IPPS
2003
IEEE
14 years 1 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
GRID
2003
Springer
14 years 29 days ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
NIPS
2007
13 years 9 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 5 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel