SlideShare a Scribd company logo
1 of 5
Download to read offline
Maximum Likelihood Estimation from Uncertain
Data in the Belief Function Framework
Abstract
We consider the problem of parameter estimation in statistical models in the case where data are
uncertain and represented as belief functions. The proposed method is based on the maximization of a
generalized likelihood criterion, which can be interpreted as a degree of agreement between the statistical model
and the uncertain observations. We propose a variant of the EM algorithm that iteratively maximizes this
criterion. As an illustration, the method is applied to uncertain data clustering using finite mixture models, in the
cases of categorical and continuous attributes.
EXISTING SYSTEM
The uncertain data mining, probability theory has often been adopted as a formal framework for
representing data uncertainty. Typically, an object is represented as a probability density function over the
attribute space, rather than as a single point as usually assumed when uncertainty is neglected. Mining
techniques that have been proposed for such data include clustering algorithms density estimation
techniquesthis recent body of literature, a lot of work has been devoted to the analysis of interval-valued or
fuzzy data, in which ill-known attributes are represented, respectively, by intervals and possibility
distributions.As examples of techniques developed for such data, we may mention principal component analysis
clustering linear regression and multidimensional scaling. Probability distributions, intervals, and possibility
distributions may be seen as three instances of a more general model, in which data uncertainty is expressed by
means of belief functions. The theory of belief functions, also known as Dempster-Shafer theory or Evidence
theory, was developed by Dempster and Shafer and was further elaborated by Smets .
GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Disadvantages
This rule was applied to regression problems with uncertain dependent variable. Methods for building
decision trees from partially supervised data were proposed.
The partially supervised learning problem based on mixture models and a variant of the EM algorithm
maximizing a generalized likelihood criterion. A similar method was used in for partially supervised
learning in hidden Markov models.
PROPOSED SYSTEM
The best solution according to the observed-data likelihood was retained. Each object was then assigned
to the class with the largest estimated posterior probability, and the obtained partition was compared to the true
partition using the adjusted Rand index. As we can see, the algorithm successfully exploits the additional
information about attribute uncertainty, which allows us to better recover the true partition of the data. Rand
index as a function of the mean error probability on class labels, for the E2M algorithm applied to data with
uncertain and noisy labels, as well as to unsupervised data. Here again, uncertainty on class labels appears to be
successfully exploited by the algorithm. Remarkably, the results with uncertain labels never get worse than
those obtained without label information, even for error probabilities close.the corroborate the above results
with real data, similar experiments were carried out with the well-known Iris data set.5 We recall that this data
set is composed of 150 4D attribute vectors partitioned in three classes, corresponding to three species of Iris.
Advantages
The best solution according to the observed-data likelihood was retained. Each object was then assigned
to the class with the largest estimated posterior probability, and the obtained partition was compared to
the true partition using the adjusted Rand index.
The additional information about attribute uncertainty, which allows us to better recover the true
partition of the data
This is achieved using the evidential EM algorithm, which is a simple extension of the classical EM
algorithm with proved convergence properties.
Module
1. Data Model
2. EM Algorithm
3. Clustering Data
4. Random Initial Conditions
5. Estimation Of Parameters
Module Description
Data Model
The data model and the generalized likelihood criterion will now first be described in the discrete
case. The interpretation of the criterion will then be discussed in and independence assumptions
allowing us to simplify its expression.
EM Algorithm
The EM algorithm is a broadly applicable mechanism for computing maximum likelihood
estimates (MLEs) from incomplete data, in situations where maximum likelihood estimation would be
straightforward if complete data were available.
Clustering Data
The application of the E2M algorithm to the clustering of uncertain categorical data based on a
latent class model. The notations and the model will first be described. The estimation algorithm for this
problem will then be given experimental results will be reported.
Random Initial Conditions
The best solution according to the observed-data likelihood was retained. Each object was then
assigned to the class with the largest estimated posterior probability, and the obtained partition was
compared to the true partition using the adjusted Rand index. We recall that this commonly used
clustering performance measure is a corrected-for-chance version of the Rand index, which equals 0 on
average for a random partition, and 1 when comparing two identical partitions.
Estimation Of Parameters
The estimation of parameters in such models, when uncertainty on attributes is represented by
belief functions with Gaussian contour functions, and partial information on class labels may also be
available in the form of arbitrary mass functions. As in the previous section the model will first be
introduced. The estimation algorithm will then be described and simulation results will be presented
Flow Chart
CONCLUSION
A method for estimating parameters in statistical models in the case of uncertain observations has been
introduced. The proposed formalism combines aleatory uncertainty captured by a parametric statistical model
with epistemic uncertainty induced by an imperfect observation process and represented by belief functions.
Our method then seeks the value of the unknown parameter that maximizes a generalized likelihood criterion,
Data Model
EM Algorithm
Clustering Data
Random Initial Conditions
Estimation Of Parameters
which can be interpreted as a degree of agreement between the parametric model and the uncertain data. This is
achieved using the evidential EM algorithm, which is a simple extension of the classical EM algorithm with
proved convergence properties. As an illustration, the method has been applied to clustering problems with
partial knowledge of class labels and attributes, based on latent class and Gaussian mixture models. In these
problems, our approach has been shown to successfully exploit the additional information about data
uncertainty, resulting in improved performances in the clustering task. More generally, the approach introduced
in this paper is applicable to any uncertain data mining problem in which a parametric statistical model can be
postulated and data uncertainty arises form an imperfect observation process. This includes a wide range of
problems such as classification, regression, feature extraction, and time series prediction.
REFERENCES
[1] C.C. Aggarwal and P.S. Yu, “A Survey of Uncertain Data Algorithms and Applications,” IEEE Trans.
Knowledge and Data Eng., vol. 21, no. 5, pp. 609-623, May 2009.
[2] C.C. Aggarwal, Managing and Mining Uncertain Data, series Advances in Data Base Systems, vol. 35.
Springer, 2009.
[3] R. Cheng, M. Chau, M. Garofalakis, and J.X. Yu, “Guest Editors’ Introduction: Special Section on Mining
Large Uncertain and Probabilistic Databases,” IEEE Trans. Knowledge and Data Eng., vol. 22, no. 9, pp. 1201-
1202, Sept. 2010.
[4] M.A. Cheema, X. Lin, W. Wang, W. Zhang, and J. Pei, “Probabilistic Reverse Nearest Neighbor Queries on
Uncertain Data,” IEEE Trans. Knowledge and Data Eng., vol. 22, no. 4, pp. 550- 564, Apr. 2010.
[5] S. Tsang, B. Kao, K. Yip, W. Ho, and S. Lee, “Decision Trees for Uncertain Data,” IEEE Trans. Knowledge
and Data Eng., vol. 23, no. 1, pp. 64-78, Jan. 2011.
[6] H.-P. Kriegel and M. Pfeifle, “Density-Based Clustering of Uncertain Data,” Proc. 11th ACM SIGKDD
Int’l Conf. Knowledge Discovery in Data Mining, pp. 672-677, 2005,
[7] W.K. Ngai, B. Kao, C.K. Chui, R. Cheng, M. Chau, and K.Y. Yip, “Efficient Clustering of Uncertain Data,”
Proc. Sixth Int’l Conf. Data Mining (ICDM ’06), pp. 436-445, 2006.

More Related Content

What's hot

Call for Papers - Applied Mathematics and Sciences: An International Journal ...
Call for Papers - Applied Mathematics and Sciences: An International Journal ...Call for Papers - Applied Mathematics and Sciences: An International Journal ...
Call for Papers - Applied Mathematics and Sciences: An International Journal ...mathsjournal
 
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...mathsjournal
 
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...mathsjournal
 
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...IJECEIAES
 
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...csandit
 
AIAA Future of Fluids 2018 Moser
AIAA Future of Fluids 2018 MoserAIAA Future of Fluids 2018 Moser
AIAA Future of Fluids 2018 MoserQiqi Wang
 
Imputation Techniques For Market Research Datasets With Missing Values
Imputation Techniques For Market Research Datasets With Missing Values Imputation Techniques For Market Research Datasets With Missing Values
Imputation Techniques For Market Research Datasets With Missing Values Salford Systems
 
Statistical Modeling: The Two Cultures
Statistical Modeling: The Two CulturesStatistical Modeling: The Two Cultures
Statistical Modeling: The Two CulturesChristoph Molnar
 
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...ijsc
 
How to correctly estimate the effect of online advertisement(About Double Mac...
How to correctly estimate the effect of online advertisement(About Double Mac...How to correctly estimate the effect of online advertisement(About Double Mac...
How to correctly estimate the effect of online advertisement(About Double Mac...Yusuke Kaneko
 
Exploratory data analysis data visualization
Exploratory data analysis data visualizationExploratory data analysis data visualization
Exploratory data analysis data visualizationDr. Hamdan Al-Sabri
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)theijes
 
Data Science - Part III - EDA & Model Selection
Data Science - Part III - EDA & Model SelectionData Science - Part III - EDA & Model Selection
Data Science - Part III - EDA & Model SelectionDerek Kane
 

What's hot (20)

Call for Papers - Applied Mathematics and Sciences: An International Journal ...
Call for Papers - Applied Mathematics and Sciences: An International Journal ...Call for Papers - Applied Mathematics and Sciences: An International Journal ...
Call for Papers - Applied Mathematics and Sciences: An International Journal ...
 
Rohit 10103543
Rohit 10103543Rohit 10103543
Rohit 10103543
 
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...
Call for Paper - December Issue - Applied Mathematics and Sciences: An Intern...
 
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...
Call for Papers (December Issue) - Applied Mathematics and Sciences: An Inter...
 
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...
Initial Optimal Parameters of Artificial Neural Network and Support Vector Re...
 
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...
FACE RECOGNITION USING PRINCIPAL COMPONENT ANALYSIS WITH MEDIAN FOR NORMALIZA...
 
AIAA Future of Fluids 2018 Moser
AIAA Future of Fluids 2018 MoserAIAA Future of Fluids 2018 Moser
AIAA Future of Fluids 2018 Moser
 
Imputation Techniques For Market Research Datasets With Missing Values
Imputation Techniques For Market Research Datasets With Missing Values Imputation Techniques For Market Research Datasets With Missing Values
Imputation Techniques For Market Research Datasets With Missing Values
 
TBerger_FinalReport
TBerger_FinalReportTBerger_FinalReport
TBerger_FinalReport
 
Statistical Modeling: The Two Cultures
Statistical Modeling: The Two CulturesStatistical Modeling: The Two Cultures
Statistical Modeling: The Two Cultures
 
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...
AN EFFICIENT PSO BASED ENSEMBLE CLASSIFICATION MODEL ON HIGH DIMENSIONAL DATA...
 
How to correctly estimate the effect of online advertisement(About Double Mac...
How to correctly estimate the effect of online advertisement(About Double Mac...How to correctly estimate the effect of online advertisement(About Double Mac...
How to correctly estimate the effect of online advertisement(About Double Mac...
 
Exploratory data analysis data visualization
Exploratory data analysis data visualizationExploratory data analysis data visualization
Exploratory data analysis data visualization
 
A1802050102
A1802050102A1802050102
A1802050102
 
my IEEE
my IEEEmy IEEE
my IEEE
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)
 
Data Science - Part III - EDA & Model Selection
Data Science - Part III - EDA & Model SelectionData Science - Part III - EDA & Model Selection
Data Science - Part III - EDA & Model Selection
 
poster_Reza
poster_Rezaposter_Reza
poster_Reza
 
Statsci
StatsciStatsci
Statsci
 
B0343011014
B0343011014B0343011014
B0343011014
 

Viewers also liked

Bao cao thuc tap dien luc
Bao cao thuc tap dien lucBao cao thuc tap dien luc
Bao cao thuc tap dien lucDoKo.VN Channel
 
Cai dep trong nghe thuat
Cai dep trong nghe thuatCai dep trong nghe thuat
Cai dep trong nghe thuatDoKo.VN Channel
 
Optimal multicast capacity and delay tradeoffs
Optimal multicast capacity and delay tradeoffsOptimal multicast capacity and delay tradeoffs
Optimal multicast capacity and delay tradeoffsIEEEFINALYEARPROJECTS
 
Two tales of privacy in online social networks
Two tales of privacy in online social networksTwo tales of privacy in online social networks
Two tales of privacy in online social networksIEEEFINALYEARPROJECTS
 
Geo community-based broadcasting for data dissemination in mobile social netw...
Geo community-based broadcasting for data dissemination in mobile social netw...Geo community-based broadcasting for data dissemination in mobile social netw...
Geo community-based broadcasting for data dissemination in mobile social netw...IEEEFINALYEARPROJECTS
 
Sort a self organizing trust model for peer-to-peer systems
Sort a self organizing trust model for peer-to-peer systemsSort a self organizing trust model for peer-to-peer systems
Sort a self organizing trust model for peer-to-peer systemsIEEEFINALYEARPROJECTS
 
Harnessing the cloud for securely outsourcing large
Harnessing the cloud for securely outsourcing largeHarnessing the cloud for securely outsourcing large
Harnessing the cloud for securely outsourcing largeIEEEFINALYEARPROJECTS
 
Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...IEEEFINALYEARPROJECTS
 
Reversible watermarking based on invariant image classification and dynamic h...
Reversible watermarking based on invariant image classification and dynamic h...Reversible watermarking based on invariant image classification and dynamic h...
Reversible watermarking based on invariant image classification and dynamic h...IEEEFINALYEARPROJECTS
 

Viewers also liked (13)

Non cooperative location privacy
Non cooperative location privacyNon cooperative location privacy
Non cooperative location privacy
 
Bao cao thuc tap dien luc
Bao cao thuc tap dien lucBao cao thuc tap dien luc
Bao cao thuc tap dien luc
 
Cai dep trong nghe thuat
Cai dep trong nghe thuatCai dep trong nghe thuat
Cai dep trong nghe thuat
 
Optimal multicast capacity and delay tradeoffs
Optimal multicast capacity and delay tradeoffsOptimal multicast capacity and delay tradeoffs
Optimal multicast capacity and delay tradeoffs
 
Luat ngan hang
Luat ngan hangLuat ngan hang
Luat ngan hang
 
Giao an day them van 8
Giao an day them van 8Giao an day them van 8
Giao an day them van 8
 
Two tales of privacy in online social networks
Two tales of privacy in online social networksTwo tales of privacy in online social networks
Two tales of privacy in online social networks
 
Bao cao thu viec
Bao cao thu viecBao cao thu viec
Bao cao thu viec
 
Geo community-based broadcasting for data dissemination in mobile social netw...
Geo community-based broadcasting for data dissemination in mobile social netw...Geo community-based broadcasting for data dissemination in mobile social netw...
Geo community-based broadcasting for data dissemination in mobile social netw...
 
Sort a self organizing trust model for peer-to-peer systems
Sort a self organizing trust model for peer-to-peer systemsSort a self organizing trust model for peer-to-peer systems
Sort a self organizing trust model for peer-to-peer systems
 
Harnessing the cloud for securely outsourcing large
Harnessing the cloud for securely outsourcing largeHarnessing the cloud for securely outsourcing large
Harnessing the cloud for securely outsourcing large
 
Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...
 
Reversible watermarking based on invariant image classification and dynamic h...
Reversible watermarking based on invariant image classification and dynamic h...Reversible watermarking based on invariant image classification and dynamic h...
Reversible watermarking based on invariant image classification and dynamic h...
 

Similar to Maximum likelihood estimation from uncertain

Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...ecway
 
Java maximum likelihood estimation from uncertain data in the belief functio...
Java  maximum likelihood estimation from uncertain data in the belief functio...Java  maximum likelihood estimation from uncertain data in the belief functio...
Java maximum likelihood estimation from uncertain data in the belief functio...ecwayerode
 
Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Ecway Technologies
 
Java maximum likelihood estimation from uncertain data in the belief functio...
Java  maximum likelihood estimation from uncertain data in the belief functio...Java  maximum likelihood estimation from uncertain data in the belief functio...
Java maximum likelihood estimation from uncertain data in the belief functio...Ecway Technologies
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...Ecway Technologies
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...Ecwayt
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...Ecwaytech
 
Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...ecwayprojects
 
Pattern Recognization.pptx
Pattern Recognization.pptxPattern Recognization.pptx
Pattern Recognization.pptxapurbamondal25
 
Performance Comparision of Machine Learning Algorithms
Performance Comparision of Machine Learning AlgorithmsPerformance Comparision of Machine Learning Algorithms
Performance Comparision of Machine Learning AlgorithmsDinusha Dilanka
 
Building Predictive Models R_caret language
Building Predictive Models R_caret languageBuilding Predictive Models R_caret language
Building Predictive Models R_caret languagejaved khan
 
Clustering heterogeneous categorical data using enhanced mini batch K-means ...
Clustering heterogeneous categorical data using enhanced mini  batch K-means ...Clustering heterogeneous categorical data using enhanced mini  batch K-means ...
Clustering heterogeneous categorical data using enhanced mini batch K-means ...IJECEIAES
 
IRJET- Error Reduction in Data Prediction using Least Square Regression Method
IRJET- Error Reduction in Data Prediction using Least Square Regression MethodIRJET- Error Reduction in Data Prediction using Least Square Regression Method
IRJET- Error Reduction in Data Prediction using Least Square Regression MethodIRJET Journal
 
Investigating Performance and Quality in Electronic Industry via Data Mining ...
Investigating Performance and Quality in Electronic Industry via Data Mining ...Investigating Performance and Quality in Electronic Industry via Data Mining ...
Investigating Performance and Quality in Electronic Industry via Data Mining ...IIRindia
 
A Novel Methodology to Implement Optimization Algorithms in Machine Learning
A Novel Methodology to Implement Optimization Algorithms in Machine LearningA Novel Methodology to Implement Optimization Algorithms in Machine Learning
A Novel Methodology to Implement Optimization Algorithms in Machine LearningVenkata Karthik Gullapalli
 
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...ijcsa
 
Machine Learning.pdf
Machine Learning.pdfMachine Learning.pdf
Machine Learning.pdfBeyaNasr1
 
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...IAEME Publication
 
Analysis of Common Supervised Learning Algorithms Through Application
Analysis of Common Supervised Learning Algorithms Through ApplicationAnalysis of Common Supervised Learning Algorithms Through Application
Analysis of Common Supervised Learning Algorithms Through Applicationaciijournal
 

Similar to Maximum likelihood estimation from uncertain (20)

Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...
 
Java maximum likelihood estimation from uncertain data in the belief functio...
Java  maximum likelihood estimation from uncertain data in the belief functio...Java  maximum likelihood estimation from uncertain data in the belief functio...
Java maximum likelihood estimation from uncertain data in the belief functio...
 
Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...
 
Java maximum likelihood estimation from uncertain data in the belief functio...
Java  maximum likelihood estimation from uncertain data in the belief functio...Java  maximum likelihood estimation from uncertain data in the belief functio...
Java maximum likelihood estimation from uncertain data in the belief functio...
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
 
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
Dotnet  maximum likelihood estimation from uncertain data in the belief funct...Dotnet  maximum likelihood estimation from uncertain data in the belief funct...
Dotnet maximum likelihood estimation from uncertain data in the belief funct...
 
Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...Maximum likelihood estimation from uncertain data in the belief function fram...
Maximum likelihood estimation from uncertain data in the belief function fram...
 
Pattern Recognization.pptx
Pattern Recognization.pptxPattern Recognization.pptx
Pattern Recognization.pptx
 
Performance Comparision of Machine Learning Algorithms
Performance Comparision of Machine Learning AlgorithmsPerformance Comparision of Machine Learning Algorithms
Performance Comparision of Machine Learning Algorithms
 
Building Predictive Models R_caret language
Building Predictive Models R_caret languageBuilding Predictive Models R_caret language
Building Predictive Models R_caret language
 
Clustering heterogeneous categorical data using enhanced mini batch K-means ...
Clustering heterogeneous categorical data using enhanced mini  batch K-means ...Clustering heterogeneous categorical data using enhanced mini  batch K-means ...
Clustering heterogeneous categorical data using enhanced mini batch K-means ...
 
IRJET- Error Reduction in Data Prediction using Least Square Regression Method
IRJET- Error Reduction in Data Prediction using Least Square Regression MethodIRJET- Error Reduction in Data Prediction using Least Square Regression Method
IRJET- Error Reduction in Data Prediction using Least Square Regression Method
 
Investigating Performance and Quality in Electronic Industry via Data Mining ...
Investigating Performance and Quality in Electronic Industry via Data Mining ...Investigating Performance and Quality in Electronic Industry via Data Mining ...
Investigating Performance and Quality in Electronic Industry via Data Mining ...
 
A Novel Methodology to Implement Optimization Algorithms in Machine Learning
A Novel Methodology to Implement Optimization Algorithms in Machine LearningA Novel Methodology to Implement Optimization Algorithms in Machine Learning
A Novel Methodology to Implement Optimization Algorithms in Machine Learning
 
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...
A ROBUST MISSING VALUE IMPUTATION METHOD MIFOIMPUTE FOR INCOMPLETE MOLECULAR ...
 
Em Algorithm | Statistics
Em Algorithm | StatisticsEm Algorithm | Statistics
Em Algorithm | Statistics
 
Machine Learning.pdf
Machine Learning.pdfMachine Learning.pdf
Machine Learning.pdf
 
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...
AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...
 
Analysis of Common Supervised Learning Algorithms Through Application
Analysis of Common Supervised Learning Algorithms Through ApplicationAnalysis of Common Supervised Learning Algorithms Through Application
Analysis of Common Supervised Learning Algorithms Through Application
 

More from IEEEFINALYEARPROJECTS

Scalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsScalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsIEEEFINALYEARPROJECTS
 
Scalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsScalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsIEEEFINALYEARPROJECTS
 
Reversible data hiding with optimal value transfer
Reversible data hiding with optimal value transferReversible data hiding with optimal value transfer
Reversible data hiding with optimal value transferIEEEFINALYEARPROJECTS
 
Query adaptive image search with hash codes
Query adaptive image search with hash codesQuery adaptive image search with hash codes
Query adaptive image search with hash codesIEEEFINALYEARPROJECTS
 
Noise reduction based on partial reference, dual-tree complex wavelet transfo...
Noise reduction based on partial reference, dual-tree complex wavelet transfo...Noise reduction based on partial reference, dual-tree complex wavelet transfo...
Noise reduction based on partial reference, dual-tree complex wavelet transfo...IEEEFINALYEARPROJECTS
 
Local directional number pattern for face analysis face and expression recogn...
Local directional number pattern for face analysis face and expression recogn...Local directional number pattern for face analysis face and expression recogn...
Local directional number pattern for face analysis face and expression recogn...IEEEFINALYEARPROJECTS
 
An access point based fec mechanism for video transmission over wireless la ns
An access point based fec mechanism for video transmission over wireless la nsAn access point based fec mechanism for video transmission over wireless la ns
An access point based fec mechanism for video transmission over wireless la nsIEEEFINALYEARPROJECTS
 
Towards differential query services in cost efficient clouds
Towards differential query services in cost efficient cloudsTowards differential query services in cost efficient clouds
Towards differential query services in cost efficient cloudsIEEEFINALYEARPROJECTS
 
Spoc a secure and privacy preserving opportunistic computing framework for mo...
Spoc a secure and privacy preserving opportunistic computing framework for mo...Spoc a secure and privacy preserving opportunistic computing framework for mo...
Spoc a secure and privacy preserving opportunistic computing framework for mo...IEEEFINALYEARPROJECTS
 
Secure and efficient data transmission for cluster based wireless sensor netw...
Secure and efficient data transmission for cluster based wireless sensor netw...Secure and efficient data transmission for cluster based wireless sensor netw...
Secure and efficient data transmission for cluster based wireless sensor netw...IEEEFINALYEARPROJECTS
 
Privacy preserving back propagation neural network learning over arbitrarily ...
Privacy preserving back propagation neural network learning over arbitrarily ...Privacy preserving back propagation neural network learning over arbitrarily ...
Privacy preserving back propagation neural network learning over arbitrarily ...IEEEFINALYEARPROJECTS
 
Enabling data dynamic and indirect mutual trust for cloud computing storage s...
Enabling data dynamic and indirect mutual trust for cloud computing storage s...Enabling data dynamic and indirect mutual trust for cloud computing storage s...
Enabling data dynamic and indirect mutual trust for cloud computing storage s...IEEEFINALYEARPROJECTS
 
A secure protocol for spontaneous wireless ad hoc networks creation
A secure protocol for spontaneous wireless ad hoc networks creationA secure protocol for spontaneous wireless ad hoc networks creation
A secure protocol for spontaneous wireless ad hoc networks creationIEEEFINALYEARPROJECTS
 
Utility privacy tradeoff in databases an information-theoretic approach
Utility privacy tradeoff in databases an information-theoretic approachUtility privacy tradeoff in databases an information-theoretic approach
Utility privacy tradeoff in databases an information-theoretic approachIEEEFINALYEARPROJECTS
 
Security analysis of a single sign on mechanism for distributed computer netw...
Security analysis of a single sign on mechanism for distributed computer netw...Security analysis of a single sign on mechanism for distributed computer netw...
Security analysis of a single sign on mechanism for distributed computer netw...IEEEFINALYEARPROJECTS
 
Securing class initialization in java like languages
Securing class initialization in java like languagesSecuring class initialization in java like languages
Securing class initialization in java like languagesIEEEFINALYEARPROJECTS
 
Secure encounter based mobile social networks requirements, designs, and trad...
Secure encounter based mobile social networks requirements, designs, and trad...Secure encounter based mobile social networks requirements, designs, and trad...
Secure encounter based mobile social networks requirements, designs, and trad...IEEEFINALYEARPROJECTS
 
Reversible data hiding in encrypted images by reserving room before encryption
Reversible data hiding in encrypted images by reserving room before encryptionReversible data hiding in encrypted images by reserving room before encryption
Reversible data hiding in encrypted images by reserving room before encryptionIEEEFINALYEARPROJECTS
 

More from IEEEFINALYEARPROJECTS (20)

Scalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsScalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewords
 
Scalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewordsScalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewords
 
Reversible data hiding with optimal value transfer
Reversible data hiding with optimal value transferReversible data hiding with optimal value transfer
Reversible data hiding with optimal value transfer
 
Query adaptive image search with hash codes
Query adaptive image search with hash codesQuery adaptive image search with hash codes
Query adaptive image search with hash codes
 
Noise reduction based on partial reference, dual-tree complex wavelet transfo...
Noise reduction based on partial reference, dual-tree complex wavelet transfo...Noise reduction based on partial reference, dual-tree complex wavelet transfo...
Noise reduction based on partial reference, dual-tree complex wavelet transfo...
 
Local directional number pattern for face analysis face and expression recogn...
Local directional number pattern for face analysis face and expression recogn...Local directional number pattern for face analysis face and expression recogn...
Local directional number pattern for face analysis face and expression recogn...
 
An access point based fec mechanism for video transmission over wireless la ns
An access point based fec mechanism for video transmission over wireless la nsAn access point based fec mechanism for video transmission over wireless la ns
An access point based fec mechanism for video transmission over wireless la ns
 
Towards differential query services in cost efficient clouds
Towards differential query services in cost efficient cloudsTowards differential query services in cost efficient clouds
Towards differential query services in cost efficient clouds
 
Spoc a secure and privacy preserving opportunistic computing framework for mo...
Spoc a secure and privacy preserving opportunistic computing framework for mo...Spoc a secure and privacy preserving opportunistic computing framework for mo...
Spoc a secure and privacy preserving opportunistic computing framework for mo...
 
Secure and efficient data transmission for cluster based wireless sensor netw...
Secure and efficient data transmission for cluster based wireless sensor netw...Secure and efficient data transmission for cluster based wireless sensor netw...
Secure and efficient data transmission for cluster based wireless sensor netw...
 
Privacy preserving back propagation neural network learning over arbitrarily ...
Privacy preserving back propagation neural network learning over arbitrarily ...Privacy preserving back propagation neural network learning over arbitrarily ...
Privacy preserving back propagation neural network learning over arbitrarily ...
 
Non cooperative location privacy
Non cooperative location privacyNon cooperative location privacy
Non cooperative location privacy
 
Enabling data dynamic and indirect mutual trust for cloud computing storage s...
Enabling data dynamic and indirect mutual trust for cloud computing storage s...Enabling data dynamic and indirect mutual trust for cloud computing storage s...
Enabling data dynamic and indirect mutual trust for cloud computing storage s...
 
A secure protocol for spontaneous wireless ad hoc networks creation
A secure protocol for spontaneous wireless ad hoc networks creationA secure protocol for spontaneous wireless ad hoc networks creation
A secure protocol for spontaneous wireless ad hoc networks creation
 
Utility privacy tradeoff in databases an information-theoretic approach
Utility privacy tradeoff in databases an information-theoretic approachUtility privacy tradeoff in databases an information-theoretic approach
Utility privacy tradeoff in databases an information-theoretic approach
 
Spatial approximate string search
Spatial approximate string searchSpatial approximate string search
Spatial approximate string search
 
Security analysis of a single sign on mechanism for distributed computer netw...
Security analysis of a single sign on mechanism for distributed computer netw...Security analysis of a single sign on mechanism for distributed computer netw...
Security analysis of a single sign on mechanism for distributed computer netw...
 
Securing class initialization in java like languages
Securing class initialization in java like languagesSecuring class initialization in java like languages
Securing class initialization in java like languages
 
Secure encounter based mobile social networks requirements, designs, and trad...
Secure encounter based mobile social networks requirements, designs, and trad...Secure encounter based mobile social networks requirements, designs, and trad...
Secure encounter based mobile social networks requirements, designs, and trad...
 
Reversible data hiding in encrypted images by reserving room before encryption
Reversible data hiding in encrypted images by reserving room before encryptionReversible data hiding in encrypted images by reserving room before encryption
Reversible data hiding in encrypted images by reserving room before encryption
 

Recently uploaded

Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXTarek Kalaji
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-pyJamie (Taka) Wang
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfJamie (Taka) Wang
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Brian Pichman
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...DianaGray10
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarPrecisely
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 

Recently uploaded (20)

Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBX
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-py
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity Webinar
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 

Maximum likelihood estimation from uncertain

  • 1. Maximum Likelihood Estimation from Uncertain Data in the Belief Function Framework Abstract We consider the problem of parameter estimation in statistical models in the case where data are uncertain and represented as belief functions. The proposed method is based on the maximization of a generalized likelihood criterion, which can be interpreted as a degree of agreement between the statistical model and the uncertain observations. We propose a variant of the EM algorithm that iteratively maximizes this criterion. As an illustration, the method is applied to uncertain data clustering using finite mixture models, in the cases of categorical and continuous attributes. EXISTING SYSTEM The uncertain data mining, probability theory has often been adopted as a formal framework for representing data uncertainty. Typically, an object is represented as a probability density function over the attribute space, rather than as a single point as usually assumed when uncertainty is neglected. Mining techniques that have been proposed for such data include clustering algorithms density estimation techniquesthis recent body of literature, a lot of work has been devoted to the analysis of interval-valued or fuzzy data, in which ill-known attributes are represented, respectively, by intervals and possibility distributions.As examples of techniques developed for such data, we may mention principal component analysis clustering linear regression and multidimensional scaling. Probability distributions, intervals, and possibility distributions may be seen as three instances of a more general model, in which data uncertainty is expressed by means of belief functions. The theory of belief functions, also known as Dempster-Shafer theory or Evidence theory, was developed by Dempster and Shafer and was further elaborated by Smets . GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. Disadvantages This rule was applied to regression problems with uncertain dependent variable. Methods for building decision trees from partially supervised data were proposed. The partially supervised learning problem based on mixture models and a variant of the EM algorithm maximizing a generalized likelihood criterion. A similar method was used in for partially supervised learning in hidden Markov models. PROPOSED SYSTEM The best solution according to the observed-data likelihood was retained. Each object was then assigned to the class with the largest estimated posterior probability, and the obtained partition was compared to the true partition using the adjusted Rand index. As we can see, the algorithm successfully exploits the additional information about attribute uncertainty, which allows us to better recover the true partition of the data. Rand index as a function of the mean error probability on class labels, for the E2M algorithm applied to data with uncertain and noisy labels, as well as to unsupervised data. Here again, uncertainty on class labels appears to be successfully exploited by the algorithm. Remarkably, the results with uncertain labels never get worse than those obtained without label information, even for error probabilities close.the corroborate the above results with real data, similar experiments were carried out with the well-known Iris data set.5 We recall that this data set is composed of 150 4D attribute vectors partitioned in three classes, corresponding to three species of Iris. Advantages The best solution according to the observed-data likelihood was retained. Each object was then assigned to the class with the largest estimated posterior probability, and the obtained partition was compared to the true partition using the adjusted Rand index. The additional information about attribute uncertainty, which allows us to better recover the true partition of the data This is achieved using the evidential EM algorithm, which is a simple extension of the classical EM algorithm with proved convergence properties.
  • 3. Module 1. Data Model 2. EM Algorithm 3. Clustering Data 4. Random Initial Conditions 5. Estimation Of Parameters Module Description Data Model The data model and the generalized likelihood criterion will now first be described in the discrete case. The interpretation of the criterion will then be discussed in and independence assumptions allowing us to simplify its expression. EM Algorithm The EM algorithm is a broadly applicable mechanism for computing maximum likelihood estimates (MLEs) from incomplete data, in situations where maximum likelihood estimation would be straightforward if complete data were available. Clustering Data The application of the E2M algorithm to the clustering of uncertain categorical data based on a latent class model. The notations and the model will first be described. The estimation algorithm for this problem will then be given experimental results will be reported. Random Initial Conditions The best solution according to the observed-data likelihood was retained. Each object was then assigned to the class with the largest estimated posterior probability, and the obtained partition was compared to the true partition using the adjusted Rand index. We recall that this commonly used clustering performance measure is a corrected-for-chance version of the Rand index, which equals 0 on average for a random partition, and 1 when comparing two identical partitions. Estimation Of Parameters The estimation of parameters in such models, when uncertainty on attributes is represented by belief functions with Gaussian contour functions, and partial information on class labels may also be
  • 4. available in the form of arbitrary mass functions. As in the previous section the model will first be introduced. The estimation algorithm will then be described and simulation results will be presented Flow Chart CONCLUSION A method for estimating parameters in statistical models in the case of uncertain observations has been introduced. The proposed formalism combines aleatory uncertainty captured by a parametric statistical model with epistemic uncertainty induced by an imperfect observation process and represented by belief functions. Our method then seeks the value of the unknown parameter that maximizes a generalized likelihood criterion, Data Model EM Algorithm Clustering Data Random Initial Conditions Estimation Of Parameters
  • 5. which can be interpreted as a degree of agreement between the parametric model and the uncertain data. This is achieved using the evidential EM algorithm, which is a simple extension of the classical EM algorithm with proved convergence properties. As an illustration, the method has been applied to clustering problems with partial knowledge of class labels and attributes, based on latent class and Gaussian mixture models. In these problems, our approach has been shown to successfully exploit the additional information about data uncertainty, resulting in improved performances in the clustering task. More generally, the approach introduced in this paper is applicable to any uncertain data mining problem in which a parametric statistical model can be postulated and data uncertainty arises form an imperfect observation process. This includes a wide range of problems such as classification, regression, feature extraction, and time series prediction. REFERENCES [1] C.C. Aggarwal and P.S. Yu, “A Survey of Uncertain Data Algorithms and Applications,” IEEE Trans. Knowledge and Data Eng., vol. 21, no. 5, pp. 609-623, May 2009. [2] C.C. Aggarwal, Managing and Mining Uncertain Data, series Advances in Data Base Systems, vol. 35. Springer, 2009. [3] R. Cheng, M. Chau, M. Garofalakis, and J.X. Yu, “Guest Editors’ Introduction: Special Section on Mining Large Uncertain and Probabilistic Databases,” IEEE Trans. Knowledge and Data Eng., vol. 22, no. 9, pp. 1201- 1202, Sept. 2010. [4] M.A. Cheema, X. Lin, W. Wang, W. Zhang, and J. Pei, “Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data,” IEEE Trans. Knowledge and Data Eng., vol. 22, no. 4, pp. 550- 564, Apr. 2010. [5] S. Tsang, B. Kao, K. Yip, W. Ho, and S. Lee, “Decision Trees for Uncertain Data,” IEEE Trans. Knowledge and Data Eng., vol. 23, no. 1, pp. 64-78, Jan. 2011. [6] H.-P. Kriegel and M. Pfeifle, “Density-Based Clustering of Uncertain Data,” Proc. 11th ACM SIGKDD Int’l Conf. Knowledge Discovery in Data Mining, pp. 672-677, 2005, [7] W.K. Ngai, B. Kao, C.K. Chui, R. Cheng, M. Chau, and K.Y. Yip, “Efficient Clustering of Uncertain Data,” Proc. Sixth Int’l Conf. Data Mining (ICDM ’06), pp. 436-445, 2006.