@inproceedings{conf/comsware/GeorgeRKK08,
	title = {A predictive handoff scheme for multi-hop heterogeneous wireless networks.},
	author = {Abraham George and Sherif Rashad and Anup Kumar and Mehmed M. Kantardzic},
	booktitle = {COMSWARE},
	crossref = {conf/comsware/2008},
	pages = {545-550},
	publisher = {IEEE},
	url = {http://dblp.uni-trier.de/db/conf/comsware/comsware2008.html#GeorgeRKK08},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/24e08bb5ee7be10c1a0c78ef9ef995a22/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1109/COMSWA.2008.4554472}, date = {2008-08-27},
	keywords = {dblp }
}

@inproceedings{Badia05,
	title = {Graph building as a mining activity: finding links in the small},
	address = {New York, NY, USA},
	author = {Antonio Badia and Mehmed Kantardzic},
	booktitle = {LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery},
	pages = {17--24},
	publisher = {ACM},
	url = {http://portal.acm.org/citation.cfm?id=1134271.1134274},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mkroell},
	description = {Graph building as a mining activity},
	abstract = {Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.},
	location = {Chicago, Illinois}, isbn = {1-59593-215-1}, doi = {http://doi.acm.org/10.1145/1134271.1134274},
	keywords = {SNA framework graph mining networks toread }
}

@inproceedings{Badia2005,
	title = {Graph building as a mining activity: finding links in the small},
	address = {New York, NY, USA},
	author = {Antonio Badia and Mehmed Kantardzic},
	booktitle = {LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery},
	pages = {17--24},
	publisher = {ACM},
	url = {http://portal.acm.org/citation.cfm?id=1134271.1134274},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/maida},
	description = {Graph building as a mining activity},
	abstract = {Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.},
	location = {Chicago, Illinois}, isbn = {1-59593-215-1}, doi = {http://doi.acm.org/10.1145/1134271.1134274},
	keywords = {imported }
}

@inproceedings{paper:badia:2005,
	title = {Graph building as a mining activity: finding links in the small},
	address = {New York, NY, USA},
	author = {Antonio Badia and Mehmed Kantardzic},
	booktitle = {LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery},
	pages = {17--24},
	publisher = {ACM},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mschuber},
	abstract = {Many analysis of data proceed by building a graph out of
the data set and then using social network theory and similar
tools on the result. However, there is no theory concerning
the construction of the graph itself, even though this is a
very important process. In this paper, we attempt to pro-
vide a framework in which the graph building process is
formalized and studied. We show the parameters (choices)
involved in constructing a graph from raw data, and pro-
pose some new ways to combine and analyze the data. We
also argue the importance of this approach in several domain
applications, including criminal/terrorist investigations.},
	keywords = {2005 RG-done analysis framework graph link-analysis mining networks similiarity }
}

@inproceedings{Badia2005,
	title = {Graph building as a mining activity: finding links in the small},
	address = {New York, NY, USA},
	author = {Antonio Badia and Mehmed Kantardzic},
	booktitle = {LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery},
	pages = {17--24},
	publisher = {ACM},
	url = {http://portal.acm.org/citation.cfm?id=1134271.1134274},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/chriskoerner},
	description = {Graph building as a mining activity},
	abstract = {Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.},
	location = {Chicago, Illinois}, isbn = {1-59593-215-1}, doi = {http://doi.acm.org/10.1145/1134271.1134274},
	keywords = {imported }
}

@inproceedings{badia2005,
	title = {{Graph building as a mining activity: finding links in the small}},
	author = {A. Badia and M. Kantardzic},
	booktitle = {Proceedings of the 3rd International Workshop on Link Discovery},
	pages = {17--24},
	publisher = {ACM Press New York, NY, USA},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/2f1dc5bb35f202f7b7d4653afa9c96035/mstrohm},
	description = {Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar
tools on the result. However, there is no theory concerning
the construction of the graph itself, even though this is a
very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.},
	keywords = {SEMINAL graphs reading-group social-factors web-science }
}

@inproceedings{conf/icdm/EmaraKKSHL07,
	title = {An Approach for Incremental Semi-supervised SVM.},
	author = {Wael Emara and Mehmed M. Kantardzic and Marcel Karnstedt and Kai-Uwe Sattler and Dirk Habich and Wolfgang Lehner},
	booktitle = {ICDM Workshops},
	crossref = {conf/icdm/2007w},
	pages = {539-544},
	publisher = {IEEE Computer Society},
	url = {http://dblp.uni-trier.de/db/conf/icdm/icdmw2007.html#EmaraKKSHL07},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2951ecce106f23f5329680afb65327a66/dblp},
	description = {dblp},
	ee = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2007.12}, date = {2008-03-12},
	keywords = {dblp }
}

@inproceedings{conf/iscc/RashadKK07,
	title = {PAC-WHN: Predictive Admission Control for Wireless Heterogeneous Networks.},
	author = {Sherif Rashad and Mehmed M. Kantardzic and Anup Kumar},
	booktitle = {ISCC},
	crossref = {conf/iscc/2007},
	pages = {139-144},
	publisher = {IEEE},
	url = {http://dblp.uni-trier.de/db/conf/iscc/iscc2007.html#RashadKK07},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/20c5809c9f443bc5a742d75939053fd8e/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1109/ISCC.2007.4381633}, date = {2008-03-07},
	keywords = {dblp }
}

@article{journals/tnn/KantardzicAE99,
	title = {Visualization of neural-network gaps based on error analysis.},
	author = {Mehmed M. Kantardzic and A. A. Aly and Adel Said Elmaghraby},
	journal = {IEEE Transactions on Neural Networks},
	number = {2},
	pages = {419-426},
	url = {http://dblp.uni-trier.de/db/journals/tnn/tnn10.html#KantardzicAE99},
	volume = {10},
	year = {1999},
	biburl = {http://www.bibsonomy.org/bibtex/2ff8f3868a3549b50204586673c9095ec/dblp},
	description = {dblp},
	ee = {http://doi.ieeecomputersociety.org/10.1109/72.750572}, date = {2008-02-16},
	keywords = {dblp }
}

@article{journals/isca/KantardzicHD01,
	title = {Artificial Neural Networks (ANN) Approach in Diagnostics of Polycythemia Vera.},
	author = {Mehmed M. Kantardzic and Hazem M. Hamdan and Benjamin Djulbegovic},
	journal = {I. J. Comput. Appl.},
	number = {2},
	url = {http://dblp.uni-trier.de/db/journals/isca/isca8.html#KantardzicHD01},
	volume = {8},
	year = {2001},
	biburl = {http://www.bibsonomy.org/bibtex/2129c32ddce9a8d4d834b35c9ec415acb/dblp},
	description = {dblp},
	date = {2008-02-08},
	keywords = {dblp }
}