Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

On Chain Folding Problems of Chain Mapper and Chain Reducer Meta Expressions

Print
PDF
International Journal of Computer Applications
© 2015 by IJCA Journal
Volume 116 - Number 16
Year of Publication: 2015
Authors:
Ravi (ravinder) Prakash G
Kiran M
10.5120/20424-2740

Ravi (ravinder) Prakash G and Kiran M. Article: On Chain Folding Problems of Chain Mapper and Chain Reducer Meta Expressions. International Journal of Computer Applications 116(16):35-42, April 2015. Full text available. BibTeX

@article{key:article,
	author = {Ravi (ravinder) Prakash G and Kiran M},
	title = {Article: On Chain Folding Problems of Chain Mapper and Chain Reducer Meta Expressions},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {116},
	number = {16},
	pages = {35-42},
	month = {April},
	note = {Full text available}
}

Abstract

Anintention of MapReduce Sets forChain Foldingexpressions analysis has to suggest criteria how Chain Foldingexpressions in Chain Folding data can be defined in a meaningful way and how they should be compared. Similitude based MapReduce Sets for Chain FoldingExpression Analysis and MapReduce Sets for Assignment is expected to adhere to fundamental principles of the scientific Chain Foldingprocess that are expressiveness of Chain Folding models and reproducibility of their Chain Foldinginference. Chain Foldingexpressions are assumed to be elements of a Chain Foldingexpression space or Conjecture class and Chain Folding data provide "information" which of these Chain Foldingexpressions should be used to interpret the Chain Folding data. An inference Chain Folding algorithm constructs the mapping between Chain Folding data and Chain Folding expressions, in particular by a Chain Foldingcost minimization process. Fluctuations in the Chain Folding data often limit the Chain Folding precision, which we can achieve to uniquely identify a single Chain Foldingexpression as interpretation of the Chain Folding data. We advocate an information theoretic perspective on Chain Foldingexpression analysis to resolve this dilemma where the tradeoff between Chain Foldinginformativeness of statistical inference Chain Foldingand their Chain Foldingstability is mirrored in the information-theoretic Chain Foldingoptimum of high Chain Foldinginformation rate and zero communicationexpression error. The inference Chain Foldingalgorithm is considered as anoutlier objectChain Foldingpath, which naturally limits the resolution of the Chain Foldingexpression space given the uncertainty of the Chain Folding data.

References

  • Ravi Prakash G, Kiran M, and Saikat Mukherjee, Asymmetric Key-Value Split Pattern Assumption over MapReduce Behavioral Model, International Journal of Computer Applications, Volume 86 – No 10, Page 30-34, January 2014.
  • Kiran M. , Saikat Mukherjee and Ravi Prakash G. , Characterization of Randomized Shuffle and Sort Quantifiability in MapReduce Model, International Journal of Computer Applications, 51-58, Volume 79, No. 5, October 2013.
  • Amresh Kumar, Kiran M. , Saikat Mukherjee and Ravi Prakash G. , Verification and Validation of MapReduce Program model for Parallel K-Means algorithm on Hadoop Cluster, International Journal of Computer Applications, 48-55, Volume 72, No. 8, June 2013.
  • Kiran M. , Amresh Kumar, Saikat Mukherjee and Ravi Prakash G. , Verification and Validation of MapReduce Program Model for Parallel Support Vector Machine Algorithm on Hadoop Cluster, International Journal of Computer Science Issues, 317-325, Vol. 10, Issue 3, No. 1, May 2013.
  • Ravi Prakash G, Kiran M and Saikat Mukherjee, On Randomized Preference Limitation Protocol for Quantifiable Shuffle and Sort Behavioral Implications in MapReduce Programming Model, Parallel & Cloud Computing, Vol. 3, Issue 1, 1-14, January 2014.
  • Ravi Prakash G, and Kiran M, On The Least Economical MapReduce Sets for Summarization Expressions, International Journal of Computer Applications, 13-20, Volume 94, No. 7, May 2014.
  • Ravi (Ravinder) Prakash G, Kiran M. , On Randomized Minimal MapReduce Sets for Filtering Expressions, International Journal of Computer Applications, Volume 98, No. 3, Pages 1-8, July 2014.
  • Ravi (Ravinder) Prakash G and Kiran M. , How Minimal are MapReduce Arrangements for Binning Expressions. International Journal of Computer Applications Volume 99 (11): 7-14, August 2014
  • Ravi (Ravinder) Prakash G and Kiran M. , Shuffling Expressions with MapReduce Arrangements and the Role of Binary Path Symmetry. International Journal of Computer Applications 102 (16): 19-24, September 2014.
  • Ravi (Ravinder) Prakash G and Kiran M; How Reduce Side Join Part File Expressions Equal MapReduce Structure into Task Consequences, Performance? International Journal of Computer Applications, Volume105(2):8-15, November 2014
  • Ravi (Ravinder) Prakash G and Kiran M; How Replicated Join Expressions Equal Map Phase or Reduce Phase in a MapReduce Structure?International Journal of Computer Applications, Volume107 (12): 43-50, No 12, December 2014.
  • Ravi (Ravinder) Prakash G and Kiran M. , On Composite Join Expressions of Map-side with many Reduce Phase. International Journal of Computer Applications Volume 110(9): 37-44, January 2015.
  • Ravi (Ravinder) Prakash G and Kiran M. "On the MapReduce Arrangements of Cartesian product Specific Expressions". International Journal of Computer Applications 112(9):34-41, February 2015.
  • Ravi (ravinder) Prakash G and Kiran M. , On Job Chaining MapReduce Meta Expressions of Mapping and Reducing Entropy Densities. International Journal of Computer Applications 113(15):20-27, March 2015.