Sciweavers

475 search results - page 77 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
WWW
2004
ACM
16 years 5 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
16 years 4 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 11 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...
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 10 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
OHS
2001
Springer
15 years 9 months ago
METIOREW: An Objective Oriented Content Based and Collaborative Recommending System
The size of Internet has been growing very fast and many documents appear every day in the Net. Users find many problems to obtain the information that they really need. In order t...
David Bueno, Ricardo Conejo, Amos David