2383 search results - page 448 / 477 » Finding Representative Set from Massive Data |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
DIS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...