|
ROLE
 Author only
BOOKMARK & SHARE
|
|
1
December 2012
Computer Networks: The International Journal of Computer and Telecommunications Networking: Volume 56 Issue 18, December, 2012
Publisher: Elsevier North-Holland, Inc.
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 produce much more satisfying search results than existing systems. The prototype with a full text and ...
Keywords:
Search engines, Google, Information retrieval, Pagerank, World Wide Web
2
June 2005
World Wide Web: Volume 8 Issue 2, June 2005
Publisher: Kluwer Academic Publishers
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 such stream of text; in this paper we discuss finding news articles on the web that are ...
Keywords:
web information retrieval, query-free search
3
May 2003
WWW '03: Proceedings of the 12th international conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 51
Downloads (6 Weeks): 4, Downloads (12 Months): 18, Downloads (Overall): 3,072
Full text available:
 PDF
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 such stream of text; in this paper we discuss finding news articles on the web that are ...
Keywords:
query-free search, web information retrieval
4
February 2003
IEEE Transactions on Knowledge and Data Engineering: Volume 15 Issue 2, February 2003
Publisher: IEEE Educational Activities Department
Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. Optimized association rules are permitted to contain uninstantiated attributes and ...
Keywords:
Association rules, support, confidence, gain, dynamic programming, region bucketing, binary space partitioning.
5
July 2000
Data Mining and Knowledge Discovery: Volume 4 Issue 2-3, July 2000
Publisher: Kluwer Academic Publishers
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 form “the existence of item A implies the existence of item B.” However, such rules indicate only a statistical ...
Keywords:
causality, data mining, text mining, association rules, market basket
6
August 1999
KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 2, Downloads (12 Months): 10, Downloads (Overall): 467
Full text available:
PDF
7
August 1998
VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases
Publisher: Morgan Kaufmann Publishers Inc.
8
April 1998
WWW7: Proceedings of the seventh international conference on World Wide Web 7
Publisher: Elsevier Science Publishers B. V.
Keywords:
PageRank, information retrieval, World Wide Web, search engines, Google
Also published in:
April 1998
Computer Networks and ISDN Systems: Volume 30 Issue 1-7, April 1, 1998
9
March 1998
WebDB '98: Selected papers from the International Workshop on The World Wide Web and Databases
Publisher: Springer-Verlag
10
January 1998
Data Mining and Knowledge Discovery: Volume 2 Issue 1, January 1998
Publisher: Kluwer Academic Publishers
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 purchasing item A often also purchases item B.” Motivated partly by the goal of generalizing beyond market basket data ...
Keywords:
text mining, association rules, market basket, dependence rules, closure properties, data mining
11
June 1997
SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Publisher: ACM
Bibliometrics:
Citation Count: 396
Downloads (6 Weeks): 13, Downloads (12 Months): 123, Downloads (Overall): 2,726
Full text available:
PDF
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 to identify rules of the type, “A customer purchasing item A often also purchases item B.” Motivated by the goal ...
Also published in:
June 1997
ACM SIGMOD Record: Volume 26 Issue 2, June 1997
12
June 1997
SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Publisher: ACM
Bibliometrics:
Citation Count: 519
Downloads (6 Weeks): 19, Downloads (12 Months): 236, Downloads (Overall): 4,163
Full text available:
PDF
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 than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We investigate the idea of item ...
Also published in:
June 1997
ACM SIGMOD Record: Volume 26 Issue 2, June 1997
13
September 1995
VLDB '95: Proceedings of the 21th International Conference on Very Large Data Bases
Publisher: Morgan Kaufmann Publishers Inc.
14
May 1995
SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Publisher: ACM
Bibliometrics:
Citation Count: 167
Downloads (6 Weeks): 7, Downloads (12 Months): 47, Downloads (Overall): 1,931
Full text available:
PDF
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 discourages owners of valuable information from sharing it with authorized users. There are two main philosophies for addressing ...
Also published in:
May 1995
ACM SIGMOD Record: Volume 24 Issue 2, May 1995
|
|
