Abstract Copy Detection Mechanisms for Digital Documents (2008)
Sergey Brin, James Davis, Hector Garcia-molina
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it...
Abstract Beyond Market Baskets: Generalizing Association Rules to Correlations (2008)
brinOcs.stanford.edu motwaniQcs.stanford.edu One of the most well-studied problems in data mining is min-ing for association rules in market basket data. Association rules, whose significance is...
Copy Detection Mechanisms for Digital Documents \Lambda (2008)
Sergey Brin, James Davis, Hector Garcia-molina
Abstract In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it...
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confidence, are intended...
Henzinger, Monika, Chang, Bay-Wei, Milch, Brian, Brin, Sergey
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one...
Sihem Amer-yahia, Luis Gravano, Sergey Brin, Taher Haveliwala, Jayavel Shanmugasundaram, Maha Abdallah, ...
Henzinger, Monika, Chang, Bay-Wei, Milch, Brian, Brin, Sergey
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one...
Henzinger, Monika, Chang, Bay-Wei, Milch, Brian, Brin, Sergey
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one...
Mining optimized gain rules for numeric attributes (2003)
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, nancial and retail sectors. Furthermore, optimized association rules are...
Mining optimized gain rules for numeric attributes (2003)
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. Furthermore, optimized association rules...
Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one...
Monika Henzinger Google, Monika Henzinger, Bay-wei Chang, Brian Milch, Sergey Brin
Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one...
The PageRank Citation Ranking: Bringing Order to the Web (1999)
Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd
The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the...
Extracting patterns and relations from the world wide web (1998)
Abstract. The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists may be scattered across thousands of...
Scalable techniques for mining causal structures (1998)
Craig Silverstein, Sergey Brin, Jeff Ullman, Rajeev Motwani
Mining for association rules in market basket data has proved a fruitful area of research. Mea-sures such as conditional probability (confi-dence) and correlation have been used to infer rules of the...
What can you do with a web in your pocket (1998)
Sergey Brin, Rajeev Motwani, Terry Winograd
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramatically. It is...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
Extracting patterns and relations from the world wide web (1998)
Abstract. The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists may be scattered across thousands of...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
Scalable Techniques for Mining Causal Structures (1998)
Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeff Ullman
Mining for association rules in market basket data has proved a fruitful area of research. Measures such as conditional probability (confidence) and correlation have been used to infer rules of the...
What can you do with a Web in your Pocket? (1998)
Sergey Brin, Rajeev Motwani, Lawrence Page, Terry Winograd
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramatically. It is...
Scalable Techniques for Mining Causal Structures (1998)
Craig Silverstein, Sergey Brin, Rajeev Motwani, Usama Fayyad
. Mining for association rules in market basket data has proved a fruitful area of research. Measures such as conditional probability (confidence) and correlation have been used to infer rules of the...
The PageRank Citation Ranking: Bringing Order to the Web (1998)
Larry Page, Sergey Brin, R. Motwani, T. Winograd
The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
Dynamic Data Mining: Exploring Large Rule Spaces by Sampling (1998)
A great challenge for data mining techniques is the huge space of potential rules which can be generated. If there are tens of thousands of items, then potential rules involving three items number in...
Scalable Techniques for Mining Causal Structures (1998)
Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeff Ullman
Mining for association rules in market basket data has proved a fruitful area of research. Measures such as conditional probability (confidence) and correlation have been used to infer rules of the...
The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and...
Dynamic itemset counting and implication rules for market basket data (1997)
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data...
Beyond Market Baskets: Generalizing Association Rules to Correlations (1997)
Sergey Brin, Rajeev Motwani, Craig Silverstein
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confidence, are intended...
Dynamic Itemset Counting and Implication Rules for Market Basket Data (1997)
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data...
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules (1997)
Craig Silverstein, Sergey Brin, Rajeev Motwani
One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: "A customer...
Copy Detection Mechanisms for Digital Documents (1995)
Sergey Brin, James Davis, Hector Garcia-molina
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it...
Copy Detection Mechanisms for Digital Documents (1995)
Sergey Brin, James Davis, Hector Garcia-molina
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it...
Near Neighbor Search in Large Metric Spaces (1995)
Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on...
Near Neighbor Search in Large Metric Spaces (1995)
Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on...
Copy detection mechanisms for digital documents (1995)
Sergey Brin, James Davis, Hector Garcia-molina
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it...