Sciweavers

252 search results - page 44 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
COLING
2010
13 years 2 months ago
Automated Translation of Semantic Relationships
We present a method for translating semantic relationships between languages where relationships are defined as pattern clusters. Given a pattern set which represents a semantic r...
Dmitry Davidov, Ari Rappoport
DATAMINE
2002
104views more  DATAMINE 2002»
13 years 7 months ago
Cubegrades: Generalizing Association Rules
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulgha...
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
14 years 8 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
DL
2000
Springer
162views Digital Library» more  DL 2000»
14 years 9 days ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
CACM
2000
147views more  CACM 2000»
13 years 7 months ago
Adaptive Web sites
Today's Web sites are intricate but not intelligent; while Web navigation is dynamic and idiosyncratic, all too often Web sites are fossils cast in HTML. In response, this pa...
Mike Perkowitz, Oren Etzioni