Exploring the power of heuristics and links in multi-relational data mining

Xiaoxin Yin; Jiawei Han

doi:10.1007/978-3-540-68123-6_2

Exploring the power of heuristics and links in multi-relational data mining

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Relational databases are the most popular repository for structured data, and are thus one of the richest sources of knowledge in the world. Because of the complexity of relational data, it is a challenging task to design efficient and scalable data mining approaches in relational databases. In this paper we discuss two methodologies to address this issue. The first methodology is to use heuristics to guide the data mining procedure, in order to avoid aimless, exhaustive search in relational databases. The second methodology is to assign certain property to each object in the database, and let different objects interact with each other along the links. Experiments show that both approaches achieve high efficiency and accuracy in real applications.

Original language	English (US)
Title of host publication	Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings
Pages	17-27
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-540-68123-6_2
State	Published - Jun 9 2008
Event	17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008 - Toronto, Canada Duration: May 20 2008 → May 23 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4994 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008
Country	Canada
City	Toronto
Period	5/20/08 → 5/23/08

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-68123-6_2

Fingerprint Dive into the research topics of 'Exploring the power of heuristics and links in multi-relational data mining'. Together they form a unique fingerprint.

Cite this

Yin, X., & Han, J. (2008). Exploring the power of heuristics and links in multi-relational data mining. In Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings (pp. 17-27). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4994 LNAI). https://doi.org/10.1007/978-3-540-68123-6_2

Exploring the power of heuristics and links in multi-relational data mining. / Yin, Xiaoxin; Han, Jiawei.

Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings. 2008. p. 17-27 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4994 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yin, X & Han, J 2008, Exploring the power of heuristics and links in multi-relational data mining. in Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4994 LNAI, pp. 17-27, 17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008, Toronto, Canada, 5/20/08. https://doi.org/10.1007/978-3-540-68123-6_2

Yin X, Han J. Exploring the power of heuristics and links in multi-relational data mining. In Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings. 2008. p. 17-27. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-68123-6_2

@inproceedings{b864ee632d3a4fbc9b1889f603adc4e7,

title = "Exploring the power of heuristics and links in multi-relational data mining",

abstract = "Relational databases are the most popular repository for structured data, and are thus one of the richest sources of knowledge in the world. Because of the complexity of relational data, it is a challenging task to design efficient and scalable data mining approaches in relational databases. In this paper we discuss two methodologies to address this issue. The first methodology is to use heuristics to guide the data mining procedure, in order to avoid aimless, exhaustive search in relational databases. The second methodology is to assign certain property to each object in the database, and let different objects interact with each other along the links. Experiments show that both approaches achieve high efficiency and accuracy in real applications.",

author = "Xiaoxin Yin and Jiawei Han",

year = "2008",

month = jun,

day = "9",

doi = "10.1007/978-3-540-68123-6_2",

language = "English (US)",

isbn = "3540681221",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "17--27",

booktitle = "Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings",

note = "17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008 ; Conference date: 20-05-2008 Through 23-05-2008",

}

TY - GEN

T1 - Exploring the power of heuristics and links in multi-relational data mining

AU - Yin, Xiaoxin

AU - Han, Jiawei

PY - 2008/6/9

Y1 - 2008/6/9

N2 - Relational databases are the most popular repository for structured data, and are thus one of the richest sources of knowledge in the world. Because of the complexity of relational data, it is a challenging task to design efficient and scalable data mining approaches in relational databases. In this paper we discuss two methodologies to address this issue. The first methodology is to use heuristics to guide the data mining procedure, in order to avoid aimless, exhaustive search in relational databases. The second methodology is to assign certain property to each object in the database, and let different objects interact with each other along the links. Experiments show that both approaches achieve high efficiency and accuracy in real applications.

AB - Relational databases are the most popular repository for structured data, and are thus one of the richest sources of knowledge in the world. Because of the complexity of relational data, it is a challenging task to design efficient and scalable data mining approaches in relational databases. In this paper we discuss two methodologies to address this issue. The first methodology is to use heuristics to guide the data mining procedure, in order to avoid aimless, exhaustive search in relational databases. The second methodology is to assign certain property to each object in the database, and let different objects interact with each other along the links. Experiments show that both approaches achieve high efficiency and accuracy in real applications.

UR - http://www.scopus.com/inward/record.url?scp=44649122147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44649122147&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-68123-6_2

DO - 10.1007/978-3-540-68123-6_2

M3 - Conference contribution

AN - SCOPUS:44649122147

SN - 3540681221

SN - 9783540681229

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 27

BT - Foundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings

T2 - 17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008

Y2 - 20 May 2008 through 23 May 2008

ER -