Sciweavers

9284 search results - page 1376 / 1857
» Knowledge State Algorithms
Sort
View
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
16 years 7 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 7 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
16 years 1 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
« Prev « First page 1376 / 1857 Last » Next »