SlideShare a Scribd company logo
© 2016, IJCERT All Rights Reserved Page| 162
International Journal of Computer Engineering In Research Trends
Volume 3, Issue 4, April-2016, pp. 162-164 ISSN (O): 2349-7084
Data Trend Analysis by Assigning Polynomial
Function For Given Data Set
Dhaneesh T,
Student, Department of Computer Science, Christ University, Bangalore
ABSTRACT:-This paper aims at explaining the method of creating a polynomial equation out of the given data set which
can be used as a representation of the data itself and can be used to run aggregation against itself to find the results. This
approach uses least-squares technique to construct a model of data and fit to a polynomial. Differential calculus technique is
used on this equation to generate the aggregated results that represents the original data set.
Keywords - Curve Fitting, Trend Analysis in Data, Data Analytics
——————————  ——————————
1. INTRODUCTION
Data analytics (DA) could be defined as science of
examining raw data with the purpose of drawing
conclusions about the information contained within.
Applications of Data Analytics or Trend Analysis are:
 Useful in computing customer satisfaction
metrics for various products in the market.
 Used for identifying trends in the market over
a period of time specific to a region on the
globe
 To forecast stock market movement based on
earlier trends that are identified etc…
2. EXISTING MODELS
Existing models of Data Analysis requires a vast
storage space to accommodate the volume of data. This
works aptly for the enterprise which has focus over
variety of metrics and grows dynamically over a short
period of time. However for the organizations that has
a clear focus on predefined metrics from the data which
is their concern for analysis, it would not be feasible
for them to support the storage space
requirement which increases the cost.
3. FITTING DATA TO A POLYNOMIAL
EQUATION: THE APPROACH
Consider we take a data set and represent them in the
vector form of pair, where - the independent
variable and is the dependent variable. We assume
that the data that we would want to represent as an
equation fits into a polynomial of nth order. Hence the
problem for us to fit this data into the equation would
be to find the coefficients for every pair of ,
This is the general equation for unknowns. We
know that to find the unknowns, we need
equations and each one would arise from
an , (independent, dependent) pair. Thus now the
task would to solve this set of equations to find the
coefficients and represent the data.
Our assumption about the data to be fit is that each
data points that we derive from the given dataset is in
the format of independent and dependent pair .
For example, consider if we want to fit the data about
the yield that a farmer gets from a crop depending on
the amount of fertilizer that the farmer uses. This is a
slow growing metrics which we would want to store
Available online at: www.ijcert.org
Dhaneesh T et al.,International Journal of Computer Engineering In Research Trends
Volume 3, Issue 4, April-2016, pp. 162-164
© 2016, IJCERT All Rights Reserved Page| 163
and run analytics over a large period of time. Here in
this example, the independent variable will be
fertilizer usage in tones and the crop yield in tones will
be the dependent variable. The graph for this example
would be as given below in the Fig 3.1:
Fig 3.1: Sample Data Fit to a Curve
Our initial task would be to generate the polynomial
equation for the dataset that represents the curve that is
shown in the above figure. Once we have the equation,
we can run differential equation on that to identify the
crop yield of the farmer corresponding to the amount
of the fertilizer that the farmer used. Decision about the
metrics selection still rests with the requirement and is
out of scope of this paper.
Once the metrics are chosen and the polynomial
equation are derived, then the same can be stored with
a minimum space requirement than storing the whole
dataset itself.
4. DIFFERENTIAL CALCULUS: FINDING
THE SLOPE AT A GIVEN POINT
Differential calculus, in practicality, is about describing
in a precise fashion the ways in which related
quantities change. This fundamentally lays down the
idea about comparison and analytics of data.
Given a function , the derivative of the function is
denoted as where is the rate of change of
the function with respect to the variable .
Example
Let’s take a scenario where a production facility, which
is capable of producing 60,000 artifacts a day, decides to
store and manage their production costs summary. We
look at two metrics here which are the number of
artifacts produced each day and the cost of production
for that day. Using the data fit method that is described
earlier; the cost versus number of artifacts produced is
mapped to the cost function as given below:
Instead of storing the entire dataset the facility decides
to store this cost function and run analytics over this.
Let’s try to find a business case where the task would be
find the number of artifacts that they should produce in
a day to minimize the production cost.
The criteria here would be to minimize the cost subject
to the fact that the value of the number of artifacts
that the facility can produce in a day, should be in the
range .
The first set of derivatives for the above cost function
would be:
Thus the critical points of the cost function is given by:
Solving the above equation we get the value of .
From the above value, it could be clearly stated that the
negative value for can be omitted. Thus this
concludes that the facility should produce 50,000
artifacts in a day to minimize the cost of production.
This value is purely based on the cost function that is
generated by a sample production detail. Thus
variation in the cost function would result in a different
value.
5. RESULTS AND DISCUSSIONS We have presented a general idea about how a
polynomial equation that is generated from the given
Dhaneesh T et al.,International Journal of Computer Engineering In Research Trends
Volume 3, Issue 4, April-2016, pp. 162-164
© 2016, IJCERT All Rights Reserved Page| 164
dataset would solve the problem of data analysis. Scilab
was used to demonstrate the method of data fit to a
curve using Least Squares Method to reduce the noise
factor while considering a vast data set. The sum of
the squares of the offset values are used instead of the
offset absolute values itself because this allows the
residuals to be treated as a continuous differentiable
quantity and thus reducing the noise. A sample curve
that was generated using the least squares method is
shown below in the Fig 5.1
Fig 5.1: Sample Curve generated using Least Squares
Method
6. CONCLUSION
Scilab tool was used to demonstrate the creation of
polynomial equation for the given data set.Future
enhancements for this idea will include usage of
Machine Learning algorithms to generate the
polynomial equations for the given data set. This will
help us in creating a model that can update the existing
equation due to merging of more data with the
archived data for the same metrics.
REFERENCES
[1] Haijun Chen, “A SPECIAL LEAST SQUARES
METHOD FOR CURVE FITTING”, Measurement and
Control Group, Dept. Electrical Engineering,
Eindhoven University of Technology, Postbus 513, 5600
MB Eindhoven, The Netherlands.
[2] Aimin Yang, “The Research on Parallel Least
Squares Curve Fitting Algorithm” College of Science
Hebei Polytechnic University Tangshan, Hebei
Province, 063009 China.
[3] Junyeong Yang and Hyeran Byun “Curve Fitting
Algorithm Using Iterative Error Minimization for
Sketch Beautification”, Dept. of Computer Science,
Yonsei University, Seoul, Korea, 120-749
[4] G. Taubin, “An improved algorithm for algebraic
curve and surface fitting”, Proc. Fourth 658-665, Berlin,
Germany.

More Related Content

What's hot (19)

PDF
Principal Component Analysis
Ricardo Wendell Rodrigues da Silveira
 
PPTX
House price prediction
SabahBegum
 
PPTX
Implement principal component analysis (PCA) in python from scratch
EshanAgarwal4
 
PDF
Machine Learning Algorithm - Decision Trees
Kush Kulshrestha
 
PDF
Re-mining Positive and Negative Association Mining Results
ertekg
 
PDF
OPTIMIZATION IN ENGINE DESIGN VIA FORMAL CONCEPT ANALYSIS USING NEGATIVE ATTR...
csandit
 
PPTX
Attribute oriented analysis
Hirra Sultan
 
PDF
Influence over the Dimensionality Reduction and Clustering for Air Quality Me...
IJAEMSJORNAL
 
PDF
Opinion mining framework using proposed RB-bayes model for text classication
IJECEIAES
 
PDF
Principal Component Analysis and Clustering
Usha Vijay
 
PDF
Mining High Utility Patterns in Large Databases using Mapreduce Framework
IRJET Journal
 
PDF
Machine Learning Algorithm - KNN
Kush Kulshrestha
 
PDF
Variance rover system
eSAT Journals
 
PDF
Variance rover system web analytics tool using data
eSAT Publishing House
 
PPTX
DMDW Lesson 08 - Further Data Mining Algorithms
Johannes Hoppe
 
PDF
Dimensionality reduction by matrix factorization using concept lattice in dat...
eSAT Journals
 
PPTX
AI: Belief Networks
DataminingTools Inc
 
PPTX
Presentation on K-Means Clustering
Pabna University of Science & Technology
 
Principal Component Analysis
Ricardo Wendell Rodrigues da Silveira
 
House price prediction
SabahBegum
 
Implement principal component analysis (PCA) in python from scratch
EshanAgarwal4
 
Machine Learning Algorithm - Decision Trees
Kush Kulshrestha
 
Re-mining Positive and Negative Association Mining Results
ertekg
 
OPTIMIZATION IN ENGINE DESIGN VIA FORMAL CONCEPT ANALYSIS USING NEGATIVE ATTR...
csandit
 
Attribute oriented analysis
Hirra Sultan
 
Influence over the Dimensionality Reduction and Clustering for Air Quality Me...
IJAEMSJORNAL
 
Opinion mining framework using proposed RB-bayes model for text classication
IJECEIAES
 
Principal Component Analysis and Clustering
Usha Vijay
 
Mining High Utility Patterns in Large Databases using Mapreduce Framework
IRJET Journal
 
Machine Learning Algorithm - KNN
Kush Kulshrestha
 
Variance rover system
eSAT Journals
 
Variance rover system web analytics tool using data
eSAT Publishing House
 
DMDW Lesson 08 - Further Data Mining Algorithms
Johannes Hoppe
 
Dimensionality reduction by matrix factorization using concept lattice in dat...
eSAT Journals
 
AI: Belief Networks
DataminingTools Inc
 
Presentation on K-Means Clustering
Pabna University of Science & Technology
 

Viewers also liked (15)

PDF
Secure Routing for MANET in Adversarial Environment
IJCERT
 
PPTX
ERG Calendar of Activities
lcmagpayo
 
PDF
Green Computing: A Methodology of Saving Energy by Resource Virtualization.
IJCERT
 
PDF
An Enhanced Predictive Proportion using TMP Algorithm in WSN Navigation
IJCERT
 
PPTX
相撲
ungsensei
 
PDF
Implementation of Motion Model Using Vanet
IJCERT
 
PDF
Ontology Based PMSE with Manifold Preference
IJCERT
 
PDF
V3 i301
IJCERT
 
PPTX
Iiee csc-upd org-dialogue
lcmagpayo
 
PDF
Multiple Encryption using ECC and Its Time Complexity Analysis
IJCERT
 
PDF
Software Engineering Domain Knowledge to Identify Duplicate Bug Reports
IJCERT
 
PDF
Intelligent Device TO Device Communication Using IoT
IJCERT
 
PPTX
Eco Atm
Alok Kumar
 
PDF
A System for Denial of Service Attack Detection Based On Multivariate Corelat...
IJCERT
 
PPTX
The Guided Discovery Model vs Concept Attainment Model
sduncan2
 
Secure Routing for MANET in Adversarial Environment
IJCERT
 
ERG Calendar of Activities
lcmagpayo
 
Green Computing: A Methodology of Saving Energy by Resource Virtualization.
IJCERT
 
An Enhanced Predictive Proportion using TMP Algorithm in WSN Navigation
IJCERT
 
相撲
ungsensei
 
Implementation of Motion Model Using Vanet
IJCERT
 
Ontology Based PMSE with Manifold Preference
IJCERT
 
V3 i301
IJCERT
 
Iiee csc-upd org-dialogue
lcmagpayo
 
Multiple Encryption using ECC and Its Time Complexity Analysis
IJCERT
 
Software Engineering Domain Knowledge to Identify Duplicate Bug Reports
IJCERT
 
Intelligent Device TO Device Communication Using IoT
IJCERT
 
Eco Atm
Alok Kumar
 
A System for Denial of Service Attack Detection Based On Multivariate Corelat...
IJCERT
 
The Guided Discovery Model vs Concept Attainment Model
sduncan2
 
Ad

Similar to Data Trend Analysis by Assigning Polynomial Function For Given Data Set (20)

PDF
OPTIMIZATION IN ENGINE DESIGN VIA FORMAL CONCEPT ANALYSIS USING NEGATIVE ATTR...
cscpconf
 
DOCX
SHAHBAZ_TECHNICAL_SEMINAR.docx
ShahbazKhan77289
 
PDF
(Gaurav sawant & dhaval sawlani)bia 678 final project report
Gaurav Sawant
 
DOCX
FSRM 582 Project
Qi(Gilbert) Zhou
 
PDF
GENETIC ALGORITHM FOR FUNCTION APPROXIMATION: AN EXPERIMENTAL INVESTIGATION
ijaia
 
PDF
IEOR 265 Final Paper_Minchao Lin
Minchao Lin
 
PPTX
fINAL ML PPT.pptx
19445KNithinbabu
 
DOCX
dl unit 4.docx for deep learning in b tech
karthikmarvel622
 
PDF
Performance Comparision of Machine Learning Algorithms
Dinusha Dilanka
 
PDF
How to understand and implement regression analysis
ClaireWhittaker5
 
PDF
Data Science Interview Questions PDF By ScholarHat
Scholarhat
 
PDF
ANALYSIS OF COMMON SUPERVISED LEARNING ALGORITHMS THROUGH APPLICATION
aciijournal
 
PDF
Analysis of Common Supervised Learning Algorithms Through Application
aciijournal
 
PDF
A study on rough set theory based
ijaia
 
PDF
A Comparative Study for Anomaly Detection in Data Mining
IRJET Journal
 
PPTX
Machine Learning.pptx
NitinSharma134320
 
PDF
Sentiment Analysis: A comparative study of Deep Learning and Machine Learning
IRJET Journal
 
PDF
Stock Price Trend Forecasting using Supervised Learning
Sharvil Katariya
 
PDF
Understanding the Applicability of Linear & Non-Linear Models Using a Case-Ba...
ijaia
 
PDF
Analysis of Common Supervised Learning Algorithms Through Application
aciijournal
 
OPTIMIZATION IN ENGINE DESIGN VIA FORMAL CONCEPT ANALYSIS USING NEGATIVE ATTR...
cscpconf
 
SHAHBAZ_TECHNICAL_SEMINAR.docx
ShahbazKhan77289
 
(Gaurav sawant & dhaval sawlani)bia 678 final project report
Gaurav Sawant
 
FSRM 582 Project
Qi(Gilbert) Zhou
 
GENETIC ALGORITHM FOR FUNCTION APPROXIMATION: AN EXPERIMENTAL INVESTIGATION
ijaia
 
IEOR 265 Final Paper_Minchao Lin
Minchao Lin
 
fINAL ML PPT.pptx
19445KNithinbabu
 
dl unit 4.docx for deep learning in b tech
karthikmarvel622
 
Performance Comparision of Machine Learning Algorithms
Dinusha Dilanka
 
How to understand and implement regression analysis
ClaireWhittaker5
 
Data Science Interview Questions PDF By ScholarHat
Scholarhat
 
ANALYSIS OF COMMON SUPERVISED LEARNING ALGORITHMS THROUGH APPLICATION
aciijournal
 
Analysis of Common Supervised Learning Algorithms Through Application
aciijournal
 
A study on rough set theory based
ijaia
 
A Comparative Study for Anomaly Detection in Data Mining
IRJET Journal
 
Machine Learning.pptx
NitinSharma134320
 
Sentiment Analysis: A comparative study of Deep Learning and Machine Learning
IRJET Journal
 
Stock Price Trend Forecasting using Supervised Learning
Sharvil Katariya
 
Understanding the Applicability of Linear & Non-Linear Models Using a Case-Ba...
ijaia
 
Analysis of Common Supervised Learning Algorithms Through Application
aciijournal
 
Ad

More from IJCERT (20)

PDF
Parametric Optimization of Rectangular Beam Type Load Cell Using Taguchi Method
IJCERT
 
PDF
Robust Resource Allocation in Relay Node Networks for Optimization Process
IJCERT
 
PDF
A Survey on: Sound Source Separation Methods
IJCERT
 
PDF
An Image representation using Compressive Sensing and Arithmetic Coding
IJCERT
 
PDF
Hard starting every initial stage: Study on Less Engine Pulling Power
IJCERT
 
PDF
Data Security Using Elliptic Curve Cryptography
IJCERT
 
PDF
SecCloudPro: A Novel Secure Cloud Storage System for Auditing and Deduplication
IJCERT
 
PDF
Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc Network
IJCERT
 
PDF
GSM Based Device Controlling and Fault Detection
IJCERT
 
PDF
Efficient Multi Server Authentication and Hybrid Authentication Method
IJCERT
 
PDF
Online Payment System using Steganography and Visual Cryptography
IJCERT
 
PDF
Prevention of Packet Hiding Methods In Selective Jamming Attack
IJCERT
 
PDF
AUTOMATIC SPEECH RECOGNITION- A SURVEY
IJCERT
 
PDF
Real Time Detection System of Driver Fatigue
IJCERT
 
PDF
A Survey on Web Page Recommendation and Data Preprocessing
IJCERT
 
PDF
IJCERT JOURNAL PUBLICATIONS HOUSE
IJCERT
 
PDF
Review of Various Image Processing Techniques for Currency Note Authentication
IJCERT
 
PDF
OBD-II and Oxygen Sensor: Review the I.C Engine - Emissions related Performance
IJCERT
 
PDF
Cloud Partitioning of Load Balancing Using Round Robin Model
IJCERT
 
PDF
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
IJCERT
 
Parametric Optimization of Rectangular Beam Type Load Cell Using Taguchi Method
IJCERT
 
Robust Resource Allocation in Relay Node Networks for Optimization Process
IJCERT
 
A Survey on: Sound Source Separation Methods
IJCERT
 
An Image representation using Compressive Sensing and Arithmetic Coding
IJCERT
 
Hard starting every initial stage: Study on Less Engine Pulling Power
IJCERT
 
Data Security Using Elliptic Curve Cryptography
IJCERT
 
SecCloudPro: A Novel Secure Cloud Storage System for Auditing and Deduplication
IJCERT
 
Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc Network
IJCERT
 
GSM Based Device Controlling and Fault Detection
IJCERT
 
Efficient Multi Server Authentication and Hybrid Authentication Method
IJCERT
 
Online Payment System using Steganography and Visual Cryptography
IJCERT
 
Prevention of Packet Hiding Methods In Selective Jamming Attack
IJCERT
 
AUTOMATIC SPEECH RECOGNITION- A SURVEY
IJCERT
 
Real Time Detection System of Driver Fatigue
IJCERT
 
A Survey on Web Page Recommendation and Data Preprocessing
IJCERT
 
IJCERT JOURNAL PUBLICATIONS HOUSE
IJCERT
 
Review of Various Image Processing Techniques for Currency Note Authentication
IJCERT
 
OBD-II and Oxygen Sensor: Review the I.C Engine - Emissions related Performance
IJCERT
 
Cloud Partitioning of Load Balancing Using Round Robin Model
IJCERT
 
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
IJCERT
 

Recently uploaded (20)

PPTX
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
PDF
Electrical Engineer operation Supervisor
ssaruntatapower143
 
PPTX
Damage of stability of a ship and how its change .pptx
ehamadulhaque
 
PPTX
Knowledge Representation : Semantic Networks
Amity University, Patna
 
PPTX
Heart Bleed Bug - A case study (Course: Cryptography and Network Security)
Adri Jovin
 
PDF
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
PPTX
Worm gear strength and wear calculation as per standard VB Bhandari Databook.
shahveer210504
 
PDF
Design Thinking basics for Engineers.pdf
CMR University
 
PPTX
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
PPTX
What is Shot Peening | Shot Peening is a Surface Treatment Process
Vibra Finish
 
PPTX
DATA BASE MANAGEMENT AND RELATIONAL DATA
gomathisankariv2
 
PDF
Basic_Concepts_in_Clinical_Biochemistry_2018كيمياء_عملي.pdf
AdelLoin
 
PPTX
Shinkawa Proposal to meet Vibration API670.pptx
AchmadBashori2
 
PPTX
Introduction to Design of Machine Elements
PradeepKumarS27
 
PPT
Carmon_Remote Sensing GIS by Mahesh kumar
DhananjayM6
 
PPTX
Presentation 2.pptx AI-powered home security systems Secure-by-design IoT fr...
SoundaryaBC2
 
DOCX
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
PDF
AI TECHNIQUES FOR IDENTIFYING ALTERATIONS IN THE HUMAN GUT MICROBIOME IN MULT...
vidyalalltv1
 
PDF
Zilliz Cloud Demo for performance and scale
Zilliz
 
PPTX
Thermal runway and thermal stability.pptx
godow93766
 
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
Electrical Engineer operation Supervisor
ssaruntatapower143
 
Damage of stability of a ship and how its change .pptx
ehamadulhaque
 
Knowledge Representation : Semantic Networks
Amity University, Patna
 
Heart Bleed Bug - A case study (Course: Cryptography and Network Security)
Adri Jovin
 
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
Worm gear strength and wear calculation as per standard VB Bhandari Databook.
shahveer210504
 
Design Thinking basics for Engineers.pdf
CMR University
 
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
What is Shot Peening | Shot Peening is a Surface Treatment Process
Vibra Finish
 
DATA BASE MANAGEMENT AND RELATIONAL DATA
gomathisankariv2
 
Basic_Concepts_in_Clinical_Biochemistry_2018كيمياء_عملي.pdf
AdelLoin
 
Shinkawa Proposal to meet Vibration API670.pptx
AchmadBashori2
 
Introduction to Design of Machine Elements
PradeepKumarS27
 
Carmon_Remote Sensing GIS by Mahesh kumar
DhananjayM6
 
Presentation 2.pptx AI-powered home security systems Secure-by-design IoT fr...
SoundaryaBC2
 
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
AI TECHNIQUES FOR IDENTIFYING ALTERATIONS IN THE HUMAN GUT MICROBIOME IN MULT...
vidyalalltv1
 
Zilliz Cloud Demo for performance and scale
Zilliz
 
Thermal runway and thermal stability.pptx
godow93766
 

Data Trend Analysis by Assigning Polynomial Function For Given Data Set

  • 1. © 2016, IJCERT All Rights Reserved Page| 162 International Journal of Computer Engineering In Research Trends Volume 3, Issue 4, April-2016, pp. 162-164 ISSN (O): 2349-7084 Data Trend Analysis by Assigning Polynomial Function For Given Data Set Dhaneesh T, Student, Department of Computer Science, Christ University, Bangalore ABSTRACT:-This paper aims at explaining the method of creating a polynomial equation out of the given data set which can be used as a representation of the data itself and can be used to run aggregation against itself to find the results. This approach uses least-squares technique to construct a model of data and fit to a polynomial. Differential calculus technique is used on this equation to generate the aggregated results that represents the original data set. Keywords - Curve Fitting, Trend Analysis in Data, Data Analytics ——————————  —————————— 1. INTRODUCTION Data analytics (DA) could be defined as science of examining raw data with the purpose of drawing conclusions about the information contained within. Applications of Data Analytics or Trend Analysis are:  Useful in computing customer satisfaction metrics for various products in the market.  Used for identifying trends in the market over a period of time specific to a region on the globe  To forecast stock market movement based on earlier trends that are identified etc… 2. EXISTING MODELS Existing models of Data Analysis requires a vast storage space to accommodate the volume of data. This works aptly for the enterprise which has focus over variety of metrics and grows dynamically over a short period of time. However for the organizations that has a clear focus on predefined metrics from the data which is their concern for analysis, it would not be feasible for them to support the storage space requirement which increases the cost. 3. FITTING DATA TO A POLYNOMIAL EQUATION: THE APPROACH Consider we take a data set and represent them in the vector form of pair, where - the independent variable and is the dependent variable. We assume that the data that we would want to represent as an equation fits into a polynomial of nth order. Hence the problem for us to fit this data into the equation would be to find the coefficients for every pair of , This is the general equation for unknowns. We know that to find the unknowns, we need equations and each one would arise from an , (independent, dependent) pair. Thus now the task would to solve this set of equations to find the coefficients and represent the data. Our assumption about the data to be fit is that each data points that we derive from the given dataset is in the format of independent and dependent pair . For example, consider if we want to fit the data about the yield that a farmer gets from a crop depending on the amount of fertilizer that the farmer uses. This is a slow growing metrics which we would want to store Available online at: www.ijcert.org
  • 2. Dhaneesh T et al.,International Journal of Computer Engineering In Research Trends Volume 3, Issue 4, April-2016, pp. 162-164 © 2016, IJCERT All Rights Reserved Page| 163 and run analytics over a large period of time. Here in this example, the independent variable will be fertilizer usage in tones and the crop yield in tones will be the dependent variable. The graph for this example would be as given below in the Fig 3.1: Fig 3.1: Sample Data Fit to a Curve Our initial task would be to generate the polynomial equation for the dataset that represents the curve that is shown in the above figure. Once we have the equation, we can run differential equation on that to identify the crop yield of the farmer corresponding to the amount of the fertilizer that the farmer used. Decision about the metrics selection still rests with the requirement and is out of scope of this paper. Once the metrics are chosen and the polynomial equation are derived, then the same can be stored with a minimum space requirement than storing the whole dataset itself. 4. DIFFERENTIAL CALCULUS: FINDING THE SLOPE AT A GIVEN POINT Differential calculus, in practicality, is about describing in a precise fashion the ways in which related quantities change. This fundamentally lays down the idea about comparison and analytics of data. Given a function , the derivative of the function is denoted as where is the rate of change of the function with respect to the variable . Example Let’s take a scenario where a production facility, which is capable of producing 60,000 artifacts a day, decides to store and manage their production costs summary. We look at two metrics here which are the number of artifacts produced each day and the cost of production for that day. Using the data fit method that is described earlier; the cost versus number of artifacts produced is mapped to the cost function as given below: Instead of storing the entire dataset the facility decides to store this cost function and run analytics over this. Let’s try to find a business case where the task would be find the number of artifacts that they should produce in a day to minimize the production cost. The criteria here would be to minimize the cost subject to the fact that the value of the number of artifacts that the facility can produce in a day, should be in the range . The first set of derivatives for the above cost function would be: Thus the critical points of the cost function is given by: Solving the above equation we get the value of . From the above value, it could be clearly stated that the negative value for can be omitted. Thus this concludes that the facility should produce 50,000 artifacts in a day to minimize the cost of production. This value is purely based on the cost function that is generated by a sample production detail. Thus variation in the cost function would result in a different value. 5. RESULTS AND DISCUSSIONS We have presented a general idea about how a polynomial equation that is generated from the given
  • 3. Dhaneesh T et al.,International Journal of Computer Engineering In Research Trends Volume 3, Issue 4, April-2016, pp. 162-164 © 2016, IJCERT All Rights Reserved Page| 164 dataset would solve the problem of data analysis. Scilab was used to demonstrate the method of data fit to a curve using Least Squares Method to reduce the noise factor while considering a vast data set. The sum of the squares of the offset values are used instead of the offset absolute values itself because this allows the residuals to be treated as a continuous differentiable quantity and thus reducing the noise. A sample curve that was generated using the least squares method is shown below in the Fig 5.1 Fig 5.1: Sample Curve generated using Least Squares Method 6. CONCLUSION Scilab tool was used to demonstrate the creation of polynomial equation for the given data set.Future enhancements for this idea will include usage of Machine Learning algorithms to generate the polynomial equations for the given data set. This will help us in creating a model that can update the existing equation due to merging of more data with the archived data for the same metrics. REFERENCES [1] Haijun Chen, “A SPECIAL LEAST SQUARES METHOD FOR CURVE FITTING”, Measurement and Control Group, Dept. Electrical Engineering, Eindhoven University of Technology, Postbus 513, 5600 MB Eindhoven, The Netherlands. [2] Aimin Yang, “The Research on Parallel Least Squares Curve Fitting Algorithm” College of Science Hebei Polytechnic University Tangshan, Hebei Province, 063009 China. [3] Junyeong Yang and Hyeran Byun “Curve Fitting Algorithm Using Iterative Error Minimization for Sketch Beautification”, Dept. of Computer Science, Yonsei University, Seoul, Korea, 120-749 [4] G. Taubin, “An improved algorithm for algebraic curve and surface fitting”, Proc. Fourth 658-665, Berlin, Germany.