Probabilistic Path Queries in Path Networks: An Effective and Efficient Clustering Methods
DOI:
https://doi.org/10.53555/nncse.v2i3.477Keywords:
Clustering, probabilistic graphs correlated, algorithmAbstract
Efficiently processing shortest path (SP) queries over stochastic networks attracted a lot of research attention as such queries are very popular in the emerging real world applications such as Intelligent Transportation Systems and communication networks whose edge weights can be modeled as a random variable. Some pervious works aim at finding the most likely SP (the path with largest probability to be SP), and others search the least-expected-weight path. In all these works, the definitions of the shortest path query are based on simple probabilistic models which can be converted into the multi-objective optimal issues on a weighted graph. Challenging problem, two algorithms, the PEEDR and the CPGS clustering algorithm. Reliable clusters are those which are not likely to be disconnected in the context of different instantiations of the uncertain graph. we provide a generalized reliability measurement from two basic intuitions (purity and size balance) to overcome the challenges from standard reliability criterion, and develop a novel k-means algorithm to solve the uncertain clustering problem.
References
[1] Yu Gu, Member, Chunpeng Gao, Gao Cong, and Ge Yu, VOL. 26, Effective and Efficient Clustering Methods for Correlated Probabilistic GraphsNO. 5, May 2014.
[2] R. Jin, L. Liu, B. Ding, and H. Wang, “Distance-constraint reachability computation in uncertain graphs,” PVLDB, vol. 4, no. 9, pp. 551–562, Jun. 2011.
C. C. Aggarwal and H. Wang, Managing and Mining Graph Data, New York, NY, USA: Springer, 2010.
M. Potamias, F. Bonchi, A. Gionis, and G. Kollios, “K-nearest neighbors in uncertain graphs,” PVLDB, vol. 3, no. 1, pp. 997–1008, Sept. 2010.
X. Lian and L. Chen, “A generic framework for handling uncertain data with local correlations,” PVLDB, vol. 4, no. 1, pp. 12–21, 2010.
P. Sen and A. Deshpande, “Representing and querying correlated tuples in probabilistic databases,” in Proc. ICDE, Istanbul, Turkey, 2007, pp. 596–605.
A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: A review,” ACM Comput. Surv., vol. 31, no. 3, pp. 264–323, Sept. 1999.
G. Kollios, M. Potamias, and E. Terzi, “Clustering large probabilistic graphs,”IEEE Trans. Knowl. Data Eng., vol. 25, no. 2, pp. 325–336,
Feb. 2013.R. Kannan,S. Vempala, and A. Vetta, “On clusterings: Good, bad and spectral,” J. ACM, vol. 51, no. 3, pp. 497–515, 2004.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Terms & Condition
Submission -
Author can submit the manuscript through our online submission process or email us at the designated email id in contact details.
The other mode of submission not accepted than online and email.
Before submission please read the submission guidelines.
NN Publication accepts only article submitted in pdf/doc/docx/rtf file format. Another format except given file formats will no be considered .
Author will be responsible for the error mistakes in the submission files. The minor changes can be done without any cost after publication. But for major changes NN Publication may charges you the editing charges.
Publication (Online) -
The online publication is scheduled on last date of every month, but it can be delayed by 24 to 48 hours due to editorial process if huge number of articles comes to publish in single issue.
Automatic notificatation email will be sent to the all users on publication of an issue, so its author’s duty to check their email inbox or SPAM folder to get this notification.
After publication of article author can not withdraw their article.
If editor’s found any issue after publication of article then the NN Publication have the authority to remove the article from online website.
No refund will be provided after online publication of article.
Publication (Print) -
The print copy publication are sent as per the author’s request after 2 weeks of online publication of that issue.
NN Publication will ship the article by India Post and provide the consignment number on dispatch of print copy.
NN Publication follows all the guidelines of delivery provided by IndiaPost and hence not responsible for delay in delivery due to any kind of reasons.
Refund of hard copy will not be provided after dispatch or print of the journal.
NN Publication will be responsible for raise a complain if there is any issue occurs in delivery, but still will not be responsible for providing the refund.
NN Publication will be responsible to resend the print copy only and only if the print copy is lost or print copy is damaged in delivery / or there is delay more than 6 months.
According to India Post the delivery should be completed with in 1-3 weeks after dispatch of articles.
Privacy Policy-
NN Publicationl uses the email ids of authors and editors and readers for sending editorial or publication notification only, we do not reveal or sell the email ids to any other website or company.
