Hiindex LOGO

Research Article

Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm


Author(s): Saranya E. , Saravanan A.M
Affiliation: Research Scholar, Department of Computer Science, Muthurangam Government Arts College (Autonomous), Vellore, Tamil Nadu, India
Year of Publication: 2018
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2018/article.php?page=929"><img src="http://www.hindex.org/sai.php/2018SCIA316F0929" alt="SAI"></a>


File:

http://www.hindex.org/2018/p929.pdf


Citation: Saranya E., Saravanan A.M. "Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm." International Journal of Computing Algorithm 7.1 (2018): 19-26.

Abstract:
Multiple-instance learning MIL is a speculation of supervised learning which tends to the order of bags. Like customary administered adapting, the greater part of the current MIL work is proposed in light of the suspicion that a delegate preparing set is accessible for a legitimate learning of the classifier. To manage this issue, we propose a novel Sphere-Description-Based approach for Multiple-Instance Learning SDB-MIL. SDB-MIL takes in an ideal circle by deciding a substantial edge among the examples, and in the meantime guaranteeing that every positive sack has no less than one occasion inside the circle and every negative bags are outside the circle. In genuine MIL applications, the negative information in the preparation set may not adequately speak to the dispersion of negative information in the testing set. Thus, how to take in a proper MIL classifier when a delegate preparing set isnt accessible turns into a key test for genuine MIL applications. From the viewpoint of hu


Keywords Event forecasts, separating applicant originators, feature constraints, instance learning unrest events predictions.


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Mod1892912, author = {Saranya E.,Saravanan A.M}, title = {Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm}, journal={International Journal of Computing Algorithm}, volume={7}, issue={1}, issn = {2278-2397}, year = {2018}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert, “A new approach to collaborative filtering: Operator estimation with spectral regularization,” J. Mach. Learn. Res., vol. 10, pp. 803–826, 2009.
  • [2] H. Achrekar, A. Gandhe, R. Lazarus, S.-H. Yu, and B. Liu, “Predicting FLU trends using Twitter data,” in Proc. IEEE Conf. Comput. Commun. Workshops, 2011, pp. 702–707.
  • [3] C. C. Aggarwal and K. Subbian, “Event detection in social streams,” in Proc. SIAM Int. Conf. Data Mining, 2012, pp. 624–635.
  • [4] R. Ando and T. Zhang, “A framework for learning predictive structures from multiple tasks and unlabeled data,” J. Mach. Learn. Res., vol. 6, pp. 1817–1853, 2005.
  • [5] A. Argyriou, T. Evgeniou, and M. Pontil, “Multi-task feature learning,” AdvancesNeuralInf.Process.Syst.,vol.19,2007,Art.no.41.
  • [6] A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183–202, 2009.
  • [7] T. Blumensath and M. E. Davies, “Iterative thresholding for sparse approximations,” J. Fourier Anal.Appl., vol. 14, no. 5/6, pp. 629– 654, 2008.
  • [8] T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,” Appl. Comput.Harmonic Anal., vol. 27, no. 3, pp. 265–274, 2009.
  • [9] J. Bollen, H. Mao, and X. Zeng, “Twitter mood predicts the stock market,” J. Comput.Sci., vol. 2, no. 1, pp. 1–8, 2011.
  • [10] R. Caruana, “Multitask learning,” Mach. Learn., vol. 28, no. 1, pp. 41–75, 1997.
  • [11] CDC,“Fluview interactive,” May 31, 2015.
  • [12] J. Chen, J. Liu, and J. Ye, “Learning incoherent sparse and lowrank patterns from multiple tasks,” ACM Trans. Knowl.Discovery Data, vol. 5 no. 4, 2012, Art.no. 22.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2018</publicationDate> <volume>7</volume> <issue>1</issue> <startPage>19</startPage> <endPage>26</endPage> <documentType>article</documentType> <title language='eng'>Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm</title> <authors> <author> <name>Saranya E.</name> </author> </authors> <abstract language='eng'>Multiple-instance learning MIL is a speculation of supervised learning which tends to the order of bags. Like customary administered adapting, the greater part of the current MIL work is proposed in light of the suspicion that a delegate preparing set is accessible for a legitimate learning of the classifier. To manage this issue, we propose a novel Sphere-Description-Based approach for Multiple-Instance Learning SDB-MIL. SDB-MIL takes in an ideal circle by deciding a substantial edge among the examples, and in the meantime guaranteeing that every positive sack has no less than one occasion inside the circle and every negative bags are outside the circle. In genuine MIL applications, the negative information in the preparation set may not adequately speak to the dispersion of negative information in the testing set. Thus, how to take in a proper MIL classifier when a delegate preparing set isnt accessible turns into a key test for genuine MIL applications. From the viewpoint of hu</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2018/p929.pdf</fullTextUrl> <keywords language='eng'> <keyword>Event forecasts, separating applicant originators, feature constraints, instance learning unrest events predictions.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2018/article.php?page=929", "name":"Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm", "author":[{"name":"Saranya E. "}], "datePublished":"2018", "description":"Multiple-instance learning MIL is a speculation of supervised learning which tends to the order of bags. Like customary administered adapting, the greater part of the current MIL work is proposed in light of the suspicion that a delegate preparing set is accessible for a legitimate learning of the classifier. To manage this issue, we propose a novel Sphere-Description-Based approach for Multiple-Instance Learning SDB-MIL. SDB-MIL takes in an ideal circle by deciding a substantial edge among the examples, and in the meantime guaranteeing that every positive sack has no less than one occasion inside the circle and every negative bags are outside the circle. In genuine MIL applications, the negative information in the preparation set may not adequately speak to the dispersion of negative information in the testing set. Thus, how to take in a proper MIL classifier when a delegate preparing set isnt accessible turns into a key test for genuine MIL applications. From the viewpoint of hu", "keywords":["Event forecasts, separating applicant originators, feature constraints, instance learning unrest events predictions."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>Saravanan A.M</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Saranya E.</dc:creator> <dc:date>2018</dc:date> <dc:description>Multiple-instance learning MIL is a speculation of supervised learning which tends to the order of bags. Like customary administered adapting, the greater part of the current MIL work is proposed in light of the suspicion that a delegate preparing set is accessible for a legitimate learning of the classifier. To manage this issue, we propose a novel Sphere-Description-Based approach for Multiple-Instance Learning SDB-MIL. SDB-MIL takes in an ideal circle by deciding a substantial edge among the examples, and in the meantime guaranteeing that every positive sack has no less than one occasion inside the circle and every negative bags are outside the circle. In genuine MIL applications, the negative information in the preparation set may not adequately speak to the dispersion of negative information in the testing set. Thus, how to take in a proper MIL classifier when a delegate preparing set isnt accessible turns into a key test for genuine MIL applications. From the viewpoint of hu</dc:description> <dc:identifier>2018SCIA316F0929</dc:identifier> <dc:language>eng</dc:language> <dc:title>Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2018SCIA316F0929", "abstract": "Multiple-instance learning MIL is a speculation of supervised learning which tends to the order of bags. Like customary administered adapting, the greater part of the current MIL work is proposed in light of the suspicion that a delegate preparing set is accessible for a legitimate learning of the classifier. To manage this issue, we propose a novel Sphere-Description-Based approach for Multiple-Instance Learning SDB-MIL. SDB-MIL takes in an ideal circle by deciding a substantial edge among the examples, and in the meantime guaranteeing that every positive sack has no less than one occasion inside the circle and every negative bags are outside the circle. In genuine MIL applications, the negative information in the preparation set may not adequately speak to the dispersion of negative information in the testing set. Thus, how to take in a proper MIL classifier when a delegate preparing set isnt accessible turns into a key test for genuine MIL applications. From the viewpoint of hu", "author": [ { "family": "Saranya E.,Saravanan A.M" } ], "id": "929", "issued": { "date-parts": [ [ 2018 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Modeling Originators For Event Forecasting Multi-task Learning In Mil Algorithm", "type": "publication-article", "version": "3" }