Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/distances-of-centroid-sets-in-a-graph-based-construction-for-0gePIaWEzJ
References (39)
-
E. Baskoro, Mirka Miller, J. Plesník (1998)
On the Structure of Digraphs with Order Close to the Moore BoundGraphs and Combinatorics, 14
-
(2006)
Optimization of classification and clustering systems based on Munn semirings -
Mirka Miller, J. Širáň (2013)
Moore Graphs and Beyond: A survey of the Degree/Diameter ProblemElectronic Journal of Combinatorics, 1000
-
J. Abawajy, A. Kelarev, M. Chowdhury (2013)
Multistage approach for clustering and classification of ECG dataComputer methods and programs in biomedicine, 112 3
-
A. Kelarev (2003)
Graph algebras and automata -
J. Abawajy, A. Kelarev (2013)
A data mining application of the incidence semiringsHouston Journal of Mathematics, 39
-
E. Spiegel, C.J. O’Donnell (1997)
Incidence Algebras -
A. Stranieri, J. Abawajy, A. Kelarev, Md. Huda, M. Chowdhury, H. Jelinek (2013)
An approach for Ewing test selection to support the clinical assessment of cardiac autonomic neuropathyArtificial intelligence in medicine, 58 3
-
E. Baskoro, Mirka Miller, J. Plesník (2000)
Further results on almost Moore digraphsArs Comb., 56
-
J. Abawajy, A. Kelarev, M. Chowdhury, A. Stranieri, H. Jelinek (2013)
Predicting cardiac autonomic neuropathy category for diabetic data with missing valuesComputers in biology and medicine, 43 10
-
J. Abawajy, A. Kelarev (2012)
A Multi-tier Ensemble Construction of Classifiers for Phishing Email Detection and Filtering -
A. Kelarev, J. Yearwood, P. Vamplew (2009)
A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATABulletin of the Australian Mathematical Society, 79
-
A.V. Kelarev, J.L. Yearwood, P.W. Vamplew (2009)
A polynomial ring construction for classification of data BullAust. Math. Soc., 79
-
A. Kelarev, D. Passman (2007)
A DESCRIPTION OF INCIDENCE RINGS OF GROUP AUTOMATA -
E. Dahlhaus, P. Horák, Mirka Miller, J. Ryan (2000)
The train marshalling problemDiscret. Appl. Math., 103
-
E. Baskoro, Y. Cholily, Mirka Miller (2008)
Enumerations of vertex orders of almost Moore digraphs with selfrepeatsDiscret. Math., 308
-
A. Kelarev, J. Yearwood, M. Mammadov (2009)
A formula for multiple classifiers in data mining based on Brandt semigroupsSemigroup Forum, 78
-
J. Golan (1999)
Semirings and their applications -
E.T. Baskoro, Y.M. Cholily, M. Miller (2006)
Structure of selfrepeat cycles in almost Moore digraphs with selfrepeats and diameter 3Bull. Inst. Combin. Appl., 46
-
D. Gao, A. Kelarev, J. Yearwood (2011)
OPTIMIZATION OF MATRIX SEMIRINGS FOR CLASSIFICATION SYSTEMSBulletin of the Australian Mathematical Society, 84
-
E. Baskoro, Mirka Miller, J. Širáň, Martin Sutton (2005)
Complete characterization of almost Moore digraphs of degree threeJournal of Graph Theory, 48
-
A. Kelarev (2002)
On undirected Cayley graphsAustralas. J Comb., 25
-
G. Beliakov, J. Yearwood, A. Kelarev (2012)
Application of Rank Correlation, Clustering and Classification in Information SecurityJ. Networks, 7
-
J. Yearwood, Dean Webb, Liping Ma, P. Vamplew, B. Ofoghi, A. Kelarev (2009)
Applying Clustering and Ensemble Clustering Approaches to phishing Profiling -
A. Kelarev (2002)
Ring constructions and applications -
I.H. Witten, E. Frank (2010)
Data Mining: Practical Machine Learning Tools and Techniques, 3rd edn -
A. Kelarev, J. Yearwood, P. Watters, Xin-Wen Wu, J. Abawajy, Lei Pan (2010)
Internet security applications of the Munn ringsSemigroup Forum, 81
-
A. Kelarev, J. Ryan, J. Yearwood (2009)
Cayley graphs as classifiers for data mining: The influence of asymmetriesDiscret. Math., 309
-
อนิรุธ สืบสิงห์ (2014)
Data Mining Practical Machine Learning Tools and TechniquesJournal of management science, 3
-
A. Kelarev (2004)
Labelled Cayley graphs and minimal automataAustralas. J Comb., 30
-
J. Abawajy, A. Kelarev, M. Chowdhury (2013)
Power graphs: A surveyElectron. J. Graph Theory Appl., 1
-
A. Kelarev, B. Kang, D. Steane (2006)
Clustering Algorithms for ITS Sequence Data with Alignment Metrics -
M. Bača, S. Jendrol’, Mirka Miller, J. Ryan (2007)
On irregular total labellingsDiscret. Math., 307
-
J. Abawajy, A. Kelarev, John Zeleznikow (2013)
Centroid sets with largest weight in Munn semirings for data mining applicationsSemigroup Forum, 87
-
J. Abawajy, A. Kelarev, Marvin Miller, J. Ryan (2014)
Incidence semirings of graphs and visible basesBulletin of The Australian Mathematical Society, 89
-
Richard Dazeley, J. Yearwood, B. Kang, A. Kelarev (2010)
Consensus Clustering and Supervised Classification for Profiling Phishing Emails in Internet Commerce Security -
A. Pasini (1977)
On incidence algebras.Le Matematiche, 32
-
J. Yearwood, A. Stranieri (2010)
Technologies for Supporting Reasoning Communities and Collaborative Decision Making: Cooperative Approaches -
A. Kelarev, Simon Brown, P. Watters, Xin-Wen Wu, Richard Dazeley (2011)
Establishing Reasoning Communities of Security Experts for Internet Commerce Security
- Publisher
- Springer Journals
- Copyright
- Copyright © 2015 by Springer Basel
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-015-0217-1
- Publisher site
- See Article on Publisher Site
Abstract
The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over a semifield, each centroid set J of the largest distance also has the largest weight, and the distance of J is equal to its weight. This result is surprising and unexpected, because examples show that distances of arbitrary centroid sets in incidence semirings may be strictly less than their weights. The investigation of the distances of centroid sets in incidence semirings of digraphs has been motivated by the information security applications of centroid sets.
Journal
Mathematics in Computer Science – Springer Journals
Published: Jun 3, 2015