-
1
-
-
0003863709
-
-
Cambridge University Press
-
Belew, R. Finding Out About, Cambridge University Press, 2000.
-
(2000)
Finding out about
-
-
Belew, R.1
-
3
-
-
0035051307
-
Finding interesting associations without support pruning
-
San Diego, California, USA, IEEE Computer Society
-
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D. and Yang, C. Finding Interesting Associations without Support Pruning, in Proceedings of the 16th International Conference on Data Engineering (ICDE) 2000, San Diego, California, USA, IEEE Computer Society.
-
(2000)
Proceedings of the 16th International Conference on Data Engineering (ICDE)
-
-
Cohen, E.1
Datar, M.2
Fujiwara, S.3
Gionis, A.4
Indyk, P.5
Motwani, R.6
Ullman, J.D.7
Yang, C.8
-
4
-
-
84875193917
-
-
Enron data set, available at http://www-2.cs.cmu.edu/7Eenron/.
-
Enron Data Set
-
-
-
5
-
-
24944535349
-
Multi-relational record linkage
-
Seattle, CA, ACM Press
-
Domingos P., Multi-Relational Record Linkage, Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining, Seattle, CA, ACM Press, 2004, pp. 31-48.
-
(2004)
Proceedings of the KDD-2004 Workshop on Multi-relational Data Mining
, pp. 31-48
-
-
Domingos, P.1
-
6
-
-
84942772223
-
Exception rule mining and with relative interestingness measure
-
Proceedings of the Knowledge Discovery and Data Mining, Current Issues and New Applications, 4th Pacific-Asia Conference (PADKK 2000), Kyoto, Japan, Springer
-
Hussain, F., Liu, H., Suzuki, E. and Lu, H. Exception Rule Mining and with Relative Interestingness Measure,in Proceedings of the Knowledge Discovery and Data Mining, Current Issues and New Applications, 4th Pacific-Asia Conference (PADKK 2000), Kyoto, Japan, 2000, Lecture Notes in Computer Science 1805, Springer.
-
(2000)
Lecture Notes in Computer Science
, vol.1805
-
-
Hussain, F.1
Liu, H.2
Suzuki, E.3
Lu, H.4
-
7
-
-
1542317694
-
Implicit link analysis for small web search
-
Toronto, Canada
-
Hue G., et al, Implicit Link Analysis for Small Web Search, SIGIR-03, Toronto, Canada, 2003.
-
(2003)
SIGIR-03
-
-
Hue, G.1
-
8
-
-
0036753864
-
Using dependency/association rules to find indications of computarized tomography in a head trauma dataset
-
September-October, Elsevier
-
Imberman, S.P., Domanski, B. and Thompson, H. W. Using Dependency/Association Rules to Find Indications of Computarized Tomography in a Head Trauma Dataset, Artificial Intelligence in Medicine, 26(1-2), September-October 2002, Elsevier.
-
(2002)
Artificial Intelligence in Medicine
, vol.26
, Issue.1-2
-
-
Imberman, S.P.1
Domanski, B.2
Thompson, H.W.3
-
9
-
-
0004241476
-
-
Springer-Verlag
-
Jarke, M., Lenzerini, M., Vassiliou, Y. and Vassiliadis, P. Fundamentals of Data Warehousing, Springer-Verlag, 2000.
-
(2000)
Fundamentals of Data Warehousing
-
-
Jarke, M.1
Lenzerini, M.2
Vassiliou, Y.3
Vassiliadis, P.4
-
10
-
-
80052121139
-
A general measure of rule interestingness
-
Proceedings of Principles of Data Mining and Knowledge Discovery, 5th European Conference (PKDD 2001) Freiburg, Germany, 2001, Springer
-
Jaroszewicz, S. and Simovici, D.A. A General Measure of Rule Interestingness, in Proceedings of Principles of Data Mining and Knowledge Discovery, 5th European Conference (PKDD 2001) Freiburg, Germany, 2001, Lecture Notes in Computer Science 2168, Springer.
-
Lecture Notes in Computer Science
, vol.2168
-
-
Jaroszewicz, S.1
Simovici, D.A.2
-
11
-
-
12244313033
-
Interestingness of frequent itemsets using Bayesian networks as background knowledge
-
Seattle, Washington, USA, ACM Press
-
Jaroszewicz, S. and Simovici, D.A. Interestingness of frequent itemsets using Bayesian networks as background knowledge, in Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 2004, ACM Press.
-
(2004)
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
-
-
Jaroszewicz, S.1
Simovici, D.A.2
-
12
-
-
12244292385
-
An efficient algorithm for discovering frequent subgraphs
-
Department of Computer Science, University of Minnesota, http://citeseer.ist.psu.edu/kuramochi02efficient.html
-
Kuramochi M., Karypis G., An Efficient Algorithm for Discovering Frequent Subgraphs, Technical report, Department of Computer Science, University of Minnesota, 2002. http://www.cs.umn.edu/kuram/papers/fsg-long.pdf. http://citeseer.ist.psu.edu/kuramochi02efficient.html
-
(2002)
Technical Report
-
-
Kuramochi, M.1
Karypis, G.2
-
14
-
-
24944454254
-
Detecting related message traffic
-
Workshop on Link Analysis, Counterterrorism, and Privacy, Seattle, WA, USA, August
-
Skillicorn D. B., Detecting Related Message Traffic, Workshop on Link Analysis, Counterterrorism, and Privacy, SIAM International Conference on Data Mining 2004, Seattle, WA, USA, August, 2004.
-
(2004)
SIAM International Conference on Data Mining 2004
-
-
Skillicorn, D.B.1
-
15
-
-
0242625291
-
Selecting the right interestingness measure for association patterns
-
Edmonton, Alberta, Canada, ACM Press
-
Tan, P., Kumar, V. and Srivastava, J. Selecting the Right Interestingness Measure for Association Patterns, in Proceedings of the Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (SIGKDD'02) 2002, Edmonton, Alberta, Canada, ACM Press.
-
(2002)
Proceedings of the Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (SIGKDD'02)
-
-
Tan, P.1
Kumar, V.2
Srivastava, J.3
-
17
-
-
4544224894
-
Using shortest path algorithms to identify criminal associations
-
Xu J. J., Chen H., Using Shortest Path Algorithms to Identify Criminal Associations, Decision Support Systems, Vol. 38, 2004, pp. 473-487.
-
(2004)
Decision Support Systems
, vol.38
, pp. 473-487
-
-
Xu, J.J.1
Chen, H.2
|