Maximum likelihood methods for data mining in datasets represented by graphs

T. Nepusz, Fülöp Bazsó

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Due to the recent boom in complex network research, large graph datasets appeared in various fields, from social sciences [1] to computer science [2]-[4] and biology [5]. There is an increasing demand for data mining methods that allow scientists to make sense of the datasets they encounter. In this paper, we present two graph models and two maximum likelihood algorithms that fit these models to pre-defined data. We also show two example applications to illustrate that these algorithms are able to extract interesting and meaningful properties from the data represented by appropriate graphs.

Original languageEnglish
Title of host publication5th International Symposium on Intelligent Systems and Informatics, SISY 2007
Pages161-165
Number of pages5
DOIs
Publication statusPublished - 2007
Event5th International Symposium on Intelligent Systems and Informatics, SISY 2007 - Subotica, Serbia
Duration: Aug 24 2007Aug 25 2007

Other

Other5th International Symposium on Intelligent Systems and Informatics, SISY 2007
CountrySerbia
CitySubotica
Period8/24/078/25/07

Fingerprint

Maximum likelihood
Data mining
Social sciences
Complex networks
Computer science
Graph
Graph model

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Information Systems and Management
  • Control and Systems Engineering

Cite this

Nepusz, T., & Bazsó, F. (2007). Maximum likelihood methods for data mining in datasets represented by graphs. In 5th International Symposium on Intelligent Systems and Informatics, SISY 2007 (pp. 161-165). [4342644] https://doi.org/10.1109/SISY.2007.4342644

Maximum likelihood methods for data mining in datasets represented by graphs. / Nepusz, T.; Bazsó, Fülöp.

5th International Symposium on Intelligent Systems and Informatics, SISY 2007. 2007. p. 161-165 4342644.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nepusz, T & Bazsó, F 2007, Maximum likelihood methods for data mining in datasets represented by graphs. in 5th International Symposium on Intelligent Systems and Informatics, SISY 2007., 4342644, pp. 161-165, 5th International Symposium on Intelligent Systems and Informatics, SISY 2007, Subotica, Serbia, 8/24/07. https://doi.org/10.1109/SISY.2007.4342644
Nepusz T, Bazsó F. Maximum likelihood methods for data mining in datasets represented by graphs. In 5th International Symposium on Intelligent Systems and Informatics, SISY 2007. 2007. p. 161-165. 4342644 https://doi.org/10.1109/SISY.2007.4342644
Nepusz, T. ; Bazsó, Fülöp. / Maximum likelihood methods for data mining in datasets represented by graphs. 5th International Symposium on Intelligent Systems and Informatics, SISY 2007. 2007. pp. 161-165
@inproceedings{e406c6bd65c641d1a588fd11de4d467e,
title = "Maximum likelihood methods for data mining in datasets represented by graphs",
abstract = "Due to the recent boom in complex network research, large graph datasets appeared in various fields, from social sciences [1] to computer science [2]-[4] and biology [5]. There is an increasing demand for data mining methods that allow scientists to make sense of the datasets they encounter. In this paper, we present two graph models and two maximum likelihood algorithms that fit these models to pre-defined data. We also show two example applications to illustrate that these algorithms are able to extract interesting and meaningful properties from the data represented by appropriate graphs.",
author = "T. Nepusz and F{\"u}l{\"o}p Bazs{\'o}",
year = "2007",
doi = "10.1109/SISY.2007.4342644",
language = "English",
isbn = "1424414431",
pages = "161--165",
booktitle = "5th International Symposium on Intelligent Systems and Informatics, SISY 2007",

}

TY - GEN

T1 - Maximum likelihood methods for data mining in datasets represented by graphs

AU - Nepusz, T.

AU - Bazsó, Fülöp

PY - 2007

Y1 - 2007

N2 - Due to the recent boom in complex network research, large graph datasets appeared in various fields, from social sciences [1] to computer science [2]-[4] and biology [5]. There is an increasing demand for data mining methods that allow scientists to make sense of the datasets they encounter. In this paper, we present two graph models and two maximum likelihood algorithms that fit these models to pre-defined data. We also show two example applications to illustrate that these algorithms are able to extract interesting and meaningful properties from the data represented by appropriate graphs.

AB - Due to the recent boom in complex network research, large graph datasets appeared in various fields, from social sciences [1] to computer science [2]-[4] and biology [5]. There is an increasing demand for data mining methods that allow scientists to make sense of the datasets they encounter. In this paper, we present two graph models and two maximum likelihood algorithms that fit these models to pre-defined data. We also show two example applications to illustrate that these algorithms are able to extract interesting and meaningful properties from the data represented by appropriate graphs.

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

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

U2 - 10.1109/SISY.2007.4342644

DO - 10.1109/SISY.2007.4342644

M3 - Conference contribution

SN - 1424414431

SN - 9781424414437

SP - 161

EP - 165

BT - 5th International Symposium on Intelligent Systems and Informatics, SISY 2007

ER -