├── LICENSE └── README.md /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ## Tensor Tracking, Streaming/Online/Adaptive/Incremental Tensor Decomposition and Dynamic Tensor Analysis 2 | 3 | A list of up-to-date research papers on streaming tensor decomposition, tensor tracking, and dynamic tensor analysis. 4 | 5 | *Contributions to improve the completeness of this list are greatly appreciated. Please feel free to open an issue, make a pull request, contribute, and revise (or contact [me](https://thanhtbt.github.io/)) if you find any missed references or errors*. 6 | 7 | ## Table of Content 8 | 9 | - [Survey and Overview Paper](#survey-paper) 10 | - [Dynamic Tensor Analysis Under CP/PARAFAC Format](#dynamic-tensor-analysis-under-cp-parafac-format) 11 | * [Subspace-based Methods](#subspace-based-methods) 12 | * [Block-Coordinate Descent (BCD)](#block-coordinate-descent--bcd-) 13 | + [BCD + Adaptive Least-Squares Filters](#bcd---adaptive-least-squares-filters) 14 | + [BCD + Stochastic Gradient Solvers](#bcd---stochastic-gradient-solvers) 15 | + [BCD + ADMM](#bcd---admm) 16 | * [Bayesian Inference](#bayesian-inference) 17 | * [Multi-aspect Streaming CP Decomposition](#multi-aspect-streaming-cp-decomposition) 18 | * [Streaming PARAFAC2 Decomposition](#streaming-parafac2-decomposition) 19 | - [Dynamic Tensor Analysis Under Tucker/HOSVD Format](#dynamic-tensor-analysis-under-tucker-hosvd-format) 20 | * [Online Tensor Dictionary Learning](#online-tensor-dictionary-learning) 21 | + [Incremental Subspace Learning on Tensor Unfolding Matrices](#incremental-subspace-learning-on-tensor-unfolding-matrices) 22 | + [Online Multimodal Dictionary Learning](#online-multimodal-dictionary-learning) 23 | * [Tensor Subspace Tracking](#tensor-subspace-tracking) 24 | * [Bayesian Inference](#bayesian-inference) 25 | * [Multi-aspect Streaming Tucker Decomposition](#multi-aspect-streaming-tucker-decomposition) 26 | - [Dynamic Tensor Analysis Under Tensor-Train Format](#dynamic-tensor-analysis-under-tensor-train-format) 27 | * [Dynamic Decomposition of Time-series Tensors with Fix-Size](#dynamic-decomposition-of-time-series-tensors-with-fix-size--non-streaming-) 28 | * [Incremental Decomposition of Tensors in Stationary Environments](#incremental-decomposition-of-tensors-in-stationary-environments--ie--tt-cores-are-fixed-over-time-) 29 | * [Streaming Decomposition of Tensors in Non-Stationary Environments](#streaming-decomposition-of-tensors-in-non-stationary-environments--ie--tt-cores-can-change-over-time-) 30 | - [Dynamic Tensor Analysis Under Block-Term Decomposition Format](#dynamic-tensor-analysis-under-block-term-decomposition-format) 31 | - [Dynamic Tensor Analysis Under T-SVD Format](#dynamic-tensor-analysis-under-t-svd-format) 32 | - [Dynamic Tensor Analysis Under Tensor-Ring/Tensor Network Format](#dynamic-tensor-analysis-under-tensor-ring-tensor-network-format) 33 | - [Dynamic/Adaptive Coupled Tensor Decomposition](#dynamic-coupled-tensor-decomposition) 34 | 35 | - [Research Challenges, Open Problems, and Future Directions](#challenges) 36 | - [Related Sources](#related-sources) 37 | * [Good Surveys of (Batch) Tensor Decomposition and Analysis](#good-surveys-of--batch--tensor--decomposition-and-analysis) 38 | * [Tensor Toolbox and Software](#tensor-toolbox-and-software) 39 | + [MATLAB](#matlab) 40 | + [Python](#python) 41 | + [R](#r) 42 | + [Julia](#julia) 43 | * [Some Applications and Datasets](#applications-datasets) 44 | - [Citation](#citation) 45 | 46 | 47 | 48 | 49 | ## [Survey and Overview Paper](#survey-paper) 50 | [*A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition*](https://ieeexplore.ieee.org/document/9994046), in **IEEE TKDE**, 2023, [PDF](https://thanhtbt.github.io/files/2022_TKDE_A%20Contemporary%20and%20Comprehensive%20Survey%20on%20Streaming%20Tensor%20Decomposition.pdf) 51 | 52 | Authors: [Thanh Trung Le](https://thanhtbt.github.io/), Karim Abed-Meraim, Nguyen Linh Trung and Adel Hafiane 53 | 54 | ![tensor_tracking](https://github.com/thanhtbt/tensor_tracking_survey/assets/26319211/6219b4d6-ce85-47ce-aa51-748661560a99) 55 | 56 | 57 | ## [Dynamic Tensor Analysis Under CP/PARAFAC Format](#dynamic-tensor-analysis-under-cp-parafac-format) 58 | ### [Subspace-based Methods](#content) 59 | 60 | * PARAFAC-SDT/-RLS: “Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor,” in **IEEE Trans. Signal Process.**, 2009, [Paper](https://ieeexplore.ieee.org/document/4799120), [PDF](https://www.ece.umn.edu/~nikos/AdaptivePARAFAC.pdf), [Code](https://github.com/thanhtbt/ROLCP/tree/main/Algorithms/PAFARAC(2009)) 61 | 62 | * 3D-OPAST: ``Fast adaptive PARAFAC decomposition algorithm with linear complexity", in **IEEE ICASSP**, 2016, [Paper](https://ieeexplore.ieee.org/document/7472876), [PDF](https://inria.hal.science/hal-01306461/file/3DOPASTLinear.pdf) 63 | 64 | * CP-PETRELS: ``Adaptive PARAFAC decomposition for third-order tensor completion", in **IEEE ICCE**, 2016, [Paper](https://ieeexplore.ieee.org/document/7562652), [PDF](http://eprints.uet.vnu.edu.vn/eprints/id/document/560) 65 | 66 | * SOAP: "Second-order optimization based adaptive PARAFAC decomposition of three-way tensors", in **Digital Signal Process.**, 2017, [Paper](https://www.sciencedirect.com/science/article/pii/S105120041730009X), [Code](https://drive.google.com/drive/folders/1x6PdEsr-1xDccm7titi5dQPLwgcKuOii) 67 | 68 | ### [Block-Coordinate Descent (BCD) Methods](#content) 69 | #### [BCD + Adaptive Least-Squares Filters](#content) 70 | 71 | * OLSTEC: "Fast online low-rank tensor subspace tracking by CP decomposition using recursive least squares from incomplete observations", in **NeuroComput.**, 2017, [Paper](https://www.sciencedirect.com/science/article/abs/pii/S0925231218313584), [PDF](https://arxiv.org/pdf/1709.10276.pdf), [Code](https://github.com/hiroyuki-kasai/OLSTEC) 72 | * Conference version: "Online low-rank tensor subspace tracking from incomplete data by CP decomposition using recursive least squares", in **IEEE ICASSP**, 2016 [Paper](https://ieeexplore.ieee.org/abstract/document/7472131), [PDF](https://arxiv.org/pdf/1602.07067.pdf), [Code](https://github.com/hiroyuki-kasai/OLSTEC) 73 | 74 | * CP-NLS: "Nonlinear least squares updating of the canonical polyadic decomposition", in **EUSIPCO**, 2017, [Paper](https://ieeexplore.ieee.org/document/8081290), [PDF](https://www.eurasip.org/Proceedings/Eusipco/Eusipco2017/papers/1570347577.pdf), [Code](https://www.tensorlabplus.net/papers/vandecappelle2017cpdu.html) 75 | 76 | * CP-stream: "Streaming tensor factorization for infinite data sources", in **SDM**, 2018, [Paper](https://epubs.siam.org/doi/abs/10.1137/1.9781611975321.10), [PDF](https://epubs.siam.org/doi/pdf/10.1137/1.9781611975321.10), [Code in Splatt Toolbox](https://github.com/ShadenSmith/splatt) 77 | 78 | * InParTen: "Incremental PARAFAC decomposition for three-dimensional tensors using Apache Spark", in **ICWE**, 2019, [Paper](https://link.springer.com/chapter/10.1007/978-3-030-19274-7_5) 79 | 80 | * TenNOODL: "Provable online CP/PARAFAC decomposition of a structured tensor via dictionary learning", in **NeurISP**, 2021, [Paper](https://dl.acm.org/doi/10.5555/3495724.3496695), [PDF](https://proceedings.neurips.cc/paper/2020/file/85b42dd8aae56e01379be5736db5b496-Paper.pdf), [Code](https://github.com/srambhatla/TensorNOODL) 81 | 82 | * SliceNStitch: "Slicenstitch: Continuous CP decomposition of sparse tensor streams", in **IEEE ICDE**, 2021, [Paper](https://ieeexplore.ieee.org/abstract/document/9458693), [PDF](https://arxiv.org/pdf/2102.11517.pdf), [Code](https://github.com/DMLab-Tensor/SliceNStitch) 83 | 84 | * STF: "Accurate online tensor factorization for temporal tensor streams with missing value", in **ACM CIKM**, 2021, [Paper](https://dl.acm.org/doi/abs/10.1145/3459637.3482048), [PDF](https://datalab.snu.ac.kr/~ukang/papers/stfCIKM21.pdf), [Code](https://github.com/snudatalab/STF) 85 | 86 | * ROLCP: "A Fast Randomized Adaptive CP Decomposition for Streaming Tensors", in **IEEE ICASSP**, 2021, [Paper](https://ieeexplore.ieee.org/abstract/document/9413554), [PDF](https://thanhtbt.github.io/files/2021_ICASSP%20-%20Randomized%20Adaptive%20CP%20Algorithm.pdf), [Code](https://github.com/thanhtbt/ROLCP) 87 | 88 | * OnlineCPDL: "Online nonnegative CP-dictionary learning for Markovian data" in **J. Mach. Learn. Res.**, 2022, [PDF](https://www.jmlr.org/papers/volume23/21-0419/21-0419.pdf), [Code](https://github.com/HanbaekLyu/OnlineCPDL) 89 | 90 | * ACP: "Tracking online low-rank approximations of higher-order incomplete streaming tensors", in **Cell Patterns**, 2023, [Paper](https://www.sciencedirect.com/science/article/pii/S2666389923001046), [PDF](https://thanhtbt.github.io/files/2023_Patterns_Tensor_Tracking_Draw.pdf), [Code](https://github.com/thanhtbt/tensor_tracking) 91 | 92 | * ALTO: "Dynamic Tensor Linearization and Time Slicing for Efficient Factorization of Infinite Data Streams", in **IEEE IPDPS**, 2023, [Paper](https://ieeexplore.ieee.org/abstract/document/10177430), [Code](https://github.com/jeewhanchoi/ALTO-stream) 93 | 94 | * OnlineGCP: "Streaming Generalized Canonical Polyadic Tensor Decompositions", in **PASC**, 2023, [Paper](https://dl.acm.org/doi/abs/10.1145/3592979.3593405), [PDF](https://arxiv.org/pdf/2110.14514.pdf), [Code](https://gitlab.com/tensors/genten) 95 | 96 | #### [BCD + Stochastic Gradient Solvers](#content) 97 | 98 | * TeCPSGD: "Subspace Learning and Imputation for Streaming Big Data Matrices and Tensors", in **IEEE Trans. Signal Process.**, 2015, [Paper](https://ieeexplore.ieee.org/document/7072498), [PDF](https://arxiv.org/pdf/1404.4667.pdf), [Code](https://github.com/hiroyuki-kasai/OLSTEC/tree/master/benchmark/TeCPSGD) 99 | 100 | * OLCP: "Accelerating Online CP Decompositions for Higher Order Tensors", in **ACM SIGKDD**, 2016, [Paper](https://dl.acm.org/doi/abs/10.1145/2939672.2939763), [PDF](https://www.kdd.org/kdd2016/papers/files/rfp0403-zhouA.pdf), [Code](https://shuozhou.github.io/) 101 | 102 | * OnlineSCP: "Online CP Decomposition for Sparse Tensors", in **IEEE ICDM**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8595011), [PDF](https://shuozhou.github.io/papers/shuo18icdm_short.pdf), [Code](https://shuozhou.github.io/) 103 | 104 | * SOFIA: "Robust Factorization of Real-world Tensor Streams with Patterns, Missing Values, and Outliers", in **IEEE ICDE**, 2020, [Paper](https://ieeexplore.ieee.org/abstract/document/9458640), [PDF](https://arxiv.org/pdf/2102.08466.pdf?trk=public_post_comment-text), [Code](https://github.com/wooner49/sofia) 105 | 106 | * iCP-AM: "Incremental CP tensor decomposition by alternating minimization method", in **SIAM J. Matrix Anal. Appl**, 2020, [Paper](https://epubs.siam.org/doi/abs/10.1137/20M1319097) 107 | 108 | * DAO-CP: "DAO-CP: Data Adaptive Online CP Decomposition", in **Plus One**, 2021, [Paper](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9009670/pdf/pone.0267091.pdf), [PDF](https://datalab.snu.ac.kr/dao-cp/resources/paper.pdf), [Code](https://github.com/lucetre-snu/dao-cp) 109 | 110 | 111 | #### [BCD + ADMM](#content) 112 | 113 | * spCP-stream: "High-Performance Streaming Tensor Decomposition", in **IEEE IPDPS**, 2021, [Paper](https://ieeexplore.ieee.org/document/9460519), [PDF](https://www.cs.uoregon.edu/Reports/DRP-202106-Soh.pdf), [Code](https://github.com/jeewhanchoi/row-sparse-cpstream) 114 | 115 | * RACP: "Robust Tensor Tracking with Missing Data and Outliers: Novel Adaptive CP Decomposition and Convergence Analysis" in **IEEE Trans. Signal Process.**, 2022, [Paper](https://ieeexplore.ieee.org/document/9866940), [PDF](https://thanhtbt.github.io/files/2022_TSP_RACP%20(Raw).pdf) 116 | 117 | * T-MUST: "Robust online tensor completion for IoT streaming data recovery", in **IEEE Trans. Neural Netw. Learn. Syst.**, 2022, [Paper](https://ieeexplore.ieee.org/abstract/document/9758937) 118 | 119 | ### [Bayesian Inference Methods](#content) 120 | 121 | * POST: "Probabilistic streaming tensor decomposition", in **IEEE ICDM**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8594834), [PDF](https://users.cs.utah.edu/~zhe/pdf/POST.pdf), [Code](https://github.com/yishuaidu/POST) 122 | 123 | * BRST: "Variational Bayesian inference for robust streaming tensor factorization and completion", in **IEEE ICDM**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8594834), [PDF](https://arxiv.org/pdf/1809.02153.pdf), [Code](https://github.com/colehawkins/Robust-Streaming-Tensor-Factorization) 124 | 125 | * SBDT: "Streaming Bayesian deep tensor factorization", in **ICML**, 2021, [Paper](https://proceedings.mlr.press/v139/fang21d.html), [PDF](https://proceedings.mlr.press/v139/fang21d/fang21d.pdf), [Code](https://github.com/xuangu-fang/Streaming-Bayesian-Deep-Tensor) 126 | 127 | * SFTL: "Streaming Factor Trajectory Learning for Temporal Tensor Decomposition", in **NeurIPS**, 2023, [Paper](https://neurips.cc/virtual/2023/poster/71689), [PDF](https://proceedings.mlr.press/v139/fang21d/fang21d.pdf), [PDF](https://arxiv.org/pdf/2310.17021.pdf), [Code](https://github.com/xuangu-fang/Streaming-Factor-Trajectory-Learning) 128 | 129 | ### [Multi-aspect Streaming CP Decomposition Methods](#content) 130 | 131 | * MASTA: "Multi-aspect-streaming tensor analysis", in **Knowl.-Based Syst.**, 2015, [Paper](https://www.sciencedirect.com/science/article/abs/pii/S0950705115002671), [PDF](https://repositorio.inesctec.pt/server/api/core/bitstreams/ca4786ca-278c-417a-8bbc-7f00b511ecfd/content), [Code](https://github.com/fanaee/MASTA/blob/main/MASTA.zip) 132 | 133 | * MAST: "Multi-aspect streaming tensor completion", in **ACM SIGKDD**, 2017, [Paper](https://dl.acm.org/doi/pdf/10.1145/3097983.3098007), [PDF](http://library.usc.edu.ph/ACM/KKD%202017/pdfs/p435.pdf), [Code](https://github.com/xuangu-fang/Streaming-Bayesian-Deep-Tensor) 134 | 135 | * OR-MSTC: "Outlier-Robust Multi-Aspect Streaming Tensor Completion and Factorization", in **IJCAI**, 2019, [Paper](https://www.ijcai.org/proceedings/2019/442), [PDF](https://www.researchgate.net/profile/Lifang-He/publication/334843950_Outlier-Robust_Multi-Aspect_Streaming_Tensor_Completion_and_Factorization/links/5e1ff98b458515ba208a85c8/Outlier-Robust-Multi-Aspect-Streaming-Tensor-Completion-and-Factorization.pdf) 136 | 137 | * InParTen2: "Multi-aspect incremental tensor decomposition based on distributed in-memory big data systems", in **J. Data Inf. Sci.**, 2020, [Paper](https://www.ijcai.org/proceedings/2019/442) 138 | 139 | * DisMASTD: "Dismastd: An efficient distributed multi-aspect streaming tensor decomposition", in **IEEE ICDE**, 2021, [Paper](https://ieeexplore.ieee.org/document/9458848), [PDF](https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=7127&context=sis_research) 140 | 141 | 142 | * GOCPT: "GOCPT: Generalized Online Canonical Polyadic Tensor Factorization and Completion", in **IJCAI**, 2022, [Paper](https://www.ijcai.org/proceedings/2022/0326.pdf), [PDF](https://arxiv.org/pdf/2205.03749.pdf), [Code](https://github.com/ycq091044/GOCPT) 143 | 144 | ### [Streaming PARAFAC2 Decomposition Methods](#content) 145 | 146 | * SPADE: "SPADE: Streaming PARAFAC2 decomposition for large datasets", in **SDM**, 2020, [Paper](https://epubs.siam.org/doi/abs/10.1137/1.9781611976236.65), [PDF](https://madlab.cs.ucr.edu/papers/2020_SDM_SPADE.pdf), [Code](http://www.cs.ucr.edu/~egujr001/ucr/madlab/src/SPADE.zip) 147 | 148 | * Dpar2: "Dpar2: Fast and scalable parafac2 decomposition for irregular dense tensors", in **IEEE ICDE**, 2022, [Paper](https://ieeexplore.ieee.org/document/9835294), [PDF](https://arxiv.org/pdf/2203.12798.pdf), [Code](https://datalab.snu.ac.kr/dpar2/) 149 | 150 | * ATOM: "Accurate PARAFAC2 Decomposition for Temporal Irregular Tensors with Missing Values", in **IEEE BigData**, 2022, [Paper](https://ieeexplore.ieee.org/document/10020667), [PDF](https://jungijang.github.io/resources/2022/BigData/atom.pdf), [Code](https://datalab.snu.ac.kr/atom/) 151 | 152 | * DASH: "Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors--Algorithm and Application", in **ACM SIGKDD**, 2023, [Paper](https://dl.acm.org/doi/abs/10.1145/3580305.3599342), [PDF](https://arxiv.org/pdf/2305.18376.pdf), [Code](https://github.com/snudatalab/Dash) 153 | 154 | * tPARAFAC2: "A Time-aware tensor decomposition for tracking evolving patterns", in ArXiv, 2023, [Paper](https://arxiv.org/pdf/2308.07126.pdf), [Code](https://github.com/cchatzis/tPARAFAC2) 155 | 156 | ### [Others](#content) 157 | 158 | * DEMOTE: "Dynamic Tensor Decomposition via Neural Diffusion-Reaction Processes", in **NeurIPS**, 2023, [Paper](https://neurips.cc/virtual/2023/poster/71967), [PDF](https://arxiv.org/pdf/2310.19666.pdf), [Code](https://github.com/wzhut/Dynamic-Tensor-Decomposition-via-Neural-Diffusion-Reaction-Processes) 159 | 160 | 161 | ## [Dynamic Tensor Analysis Under Tucker/HOSVD Format](#content) 162 | 163 | ### [Online Tensor Dictionary Learning Methods](#content) 164 | #### [Incremental Subspace Learning on Tensor Unfolding Matrices](#content) 165 | 166 | * DTA and STA: "Beyond streams and graphs: dynamic tensor analysis", in **ACM SIGKDD**, 2007, [Paper](https://dl.acm.org/doi/abs/10.1145/1150402.1150445), [PDF](https://www.cs.cmu.edu/~christos/PUBLICATIONS/kdd06DTA.pdf), [TKDD](https://doi.org/10.1145/1409620.1409621), [Code](https://www.sunlab.org/software) 167 | 168 | * IRTSA: "Robust visual tracking based on incremental tensor subspace learning", in **IEEE ICCV**, 2007, [Paper](https://ieeexplore.ieee.org/abstract/document/4408950), [PDF](https://web.archive.org/web/20170811190623id_/http://www.isee.zju.edu.cn/dsec/pdf/iccv07_final.pdf), [IJCV](https://link.springer.com/content/pdf/10.1007/s11263-010-0399-6.pdf), [M-Code](https://www.cs.toronto.edu/~dross/ivt/), [P-Code](https://github.com/matkovst/IncrementalVisualTracker-python) 169 | 170 | * RTSL: "Robust tensor subspace learning for anomaly detection", in **Int. J. Mach. Learn. Cybern**, 2011, [Paper](https://link.springer.com/article/10.1007/s13042-011-0017-0), [PDF](https://d1wqtxts1xzle7.cloudfront.net/44758963/Robust_tensor_subspace_learning_for_anom20160415-2942-1k05299-libre.pdf?1460719842=&response-content-disposition=inline%3B+filename%3DRobust_tensor_subspace_learning_for_anom.pdf&Expires=1699913109&Signature=GuYaEuc17BoLAtxz8fQHYrYCEurs8yyvb68Hq2jeqCI9xiIA45AwJ8Zpuv~L-QDBRdHFR7OB9eaeB93kRL2Kyk9gbUIBvkle4BeFKZkHT-451vXu5wgVVdBdCNXS5iLQaU2moCFPZ6RH57y1C9R3cGMhG8Gnw4yuFq~maDBmAThTKxbSiXK-yzBZ47TtI4KPKcylq50TfrsqzNxmHMXM7kCY8qXk0KYVhmbPM9NcwSlr-iLAfNQJUBBFtXknsrTQbxqckmar4OZQ-wmzW4UO5C31bx84u39Fi2qd2DhvHEeG6Bbz5UB310gDrbptV0gWvm48tTQdb1Yh0ziusuvMqw__&Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA) 171 | 172 | * ITF: "An incremental tensor factorization approach for web service recommendation", in **IEEE ICDM Works**, 2014, [Paper](https://ieeexplore.ieee.org/abstract/document/7022617) 173 | 174 | * Online-LRTL: "Accelerated online low rank tensor learning for multivariate spatiotemporal streams", in **ICML**, 2015, [Paper](https://proceedings.mlr.press/v37/yua15.html), [PDF](https://proceedings.mlr.press/v37/yua15.pdf), [Matlab](https://roseyu.com/code.html), [Python](https://nbviewer.org/github/xinychen/tensor-learning/blob/master/baselines/Online-LRTL.ipynb) 175 | 176 | * IHOSVD: "A tensor-based approach for big data representation and dimensionality reduction", in **IEEE Trans. Emerg. Topics Comput.**, 2014, [Paper](https://ieeexplore.ieee.org/abstract/document/6832490), [PDF](https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6832490) 177 | 178 | * Ho-RLSL: "Recursive tensor subspace tracking for dynamic brain network analysis", in **IEEE Trans. Signal Inf. Process. Netw.**, 2017, [Paper](https://ieeexplore.ieee.org/abstract/document/7852497), [PDF](https://ieeexplore.ieee.org/ielaam/6884276/8098622/7852497-aam.pdf) 179 | 180 | * DHOSVD: "A distributed HOSVD method with its incremental computation for big data in cyber-physical-social systems", in **IEEE Trans. Comput. Social Syst.**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8357923), [PDF](https://www.researchgate.net/profile/Liu-Huazhong/publication/327298675_An_Incremental_Tensor-Train_Decomposition_for_Cyber-Physical-Social_Big_Data/links/5cc8e492a6fdcc1d49bbfe40/An-Incremental-Tensor-Train-Decomposition-for-Cyber-Physical-Social-Big-Data.pdf) 181 | 182 | * MDHOSVD: "A multi-order distributed HOSVD with its incremental computing for big services in cyber-physical-social systems", in **IEEE Trans. Big Data**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8333789) 183 | 184 | * IMDHOSVD: "Improved multi-order distributed HOSVD with its incremental computing for smart city services", in **IEEE Trans. Sustain. Comput.**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8536482) 185 | 186 | 187 | 188 | #### [Online Multimodal Dictionary Learning](#content) 189 | 190 | * Singleshot: "Singleshot: A scalable Tucker tensor decomposition", in **NeurIPS**, 2019, [Paper](https://proceedings.neurips.cc/paper/2019/hash/384babc3e7faa44cf1ca671b74499c3b-Abstract.html), [PDF](https://proceedings.neurips.cc/paper_files/paper/2019/file/384babc3e7faa44cf1ca671b74499c3b-Paper.pdf) 191 | 192 | * OTDL: "Online multimodal dictionary learning", in **NeuroComput.**, 2019, [Paper](https://www.sciencedirect.com/science/article/pii/S0925231219311919), [PDF](https://www.researchgate.net/profile/Traore-Abraham/publication/335445803_Online_Multimodal_Dictionary_Learning/links/5ddca6c7458515dc2f4dd091/Online-Multimodal-Dictionary-Learning.pdf) 193 | 194 | * ODL: "Learning separable dictionaries for sparse tensor representation: An online approach", in **IEEE Trans. Circuits Syst. II**, 2019, [Paper](https://ieeexplore.ieee.org/abstract/document/8424902) 195 | 196 | * ORLTM: "Online robust low-rank tensor modeling for streaming data analysis", in **IEEE Trans. Neural Netw. Learn. Syst.**, 2019, [Paper](https://ieeexplore.ieee.org/abstract/document/8440682) 197 | 198 | * TTMTS: "Low-rank Tucker approximation of a tensor from streaming data", in **SIAM J. Math. Data Sci.**, 2020, [Paper](https://epubs.siam.org/doi/abs/10.1137/19M1257718), [PDF](https://arxiv.org/abs/1904.10951), [Code](https://github.com/udellgroup/tensorsketch) 199 | 200 | * Zoom-Tucker: "Fast and Memory-Efficient Tucker Decomposition for Answering Diverse Time Range Queries" in **ACM SIGKDD**, 2021, [Paper](https://dl.acm.org/doi/abs/10.1145/3447548.3467290), [PDF](https://jungijang.github.io/resources/2021/KDD/zoomtucker.pdf), [Code](https://datalab.snu.ac.kr/zoomtucker/) 201 | 202 | 203 | * OLRTR: "Streaming data preprocessing via online tensor recovery for large environmental sensor networks", in **ACM Trans. Knowl. Disc. Data**, 2022, [Paper](https://dl.acm.org/doi/abs/10.1145/3532189), [PDF](https://lab-work.github.io/download/HuStreaming2021.pdf), [Code](https://github.com/yuehu9/Online_Robust_Tensor_Recovery) 204 | 205 | * D-L1-Tucker: "Dynamic L1-norm Tucker tensor decomposition", in **IEEE J. Sel. Topics Signal Process.**, 2021, [Paper](https://ieeexplore.ieee.org/abstract/document/9358012), [PDF](https://ieeexplore.ieee.org/ielaam/4200690/9393360/9358012-aam.pdf), [Code](https://github.com/dgchachlakis/L1-norm-Tucker-Tensor-Decomposition) 206 | 207 | * ROLTD: "Robust Online Tucker Dictionary Learning from Multidimensional Data Streams", in **APSIPA-ASC**, 2022, [Paper](https://ieeexplore.ieee.org/abstract/document/9980029), [PDF](https://thanhtbt.github.io/files/2022_APSIPA_Robust%20Online%20Tucker%20Dictionary%20Learning%20from%20Multidimensional%20Data%20Streams.pdf), [Code](https://github.com/thanhtbt/ROTDL) 208 | 209 | 210 | ### [Tensor Subspace Tracking Methods](#content) 211 | 212 | * LRUT: "Accelerated low-rank updates to tensor decompositions", in **IEEE HPEC**, 2016, [Paper](https://ieeexplore.ieee.org/abstract/document/7761607), [PDF](http://www.harperlangston.com/papers/lowrank_hpec.pdf) 213 | 214 | * Riemannian-based method: "Low-rank tensor completion: a Riemannian manifold preconditioning approach", in **ICML**, 2016, [Paper](https://proceedings.mlr.press/v48/kasai16.html), [PDF](https://proceedings.mlr.press/v48/kasai16.pdf), [Code](https://bamdevmishra.in/codes/tensorcompletion/) 215 | 216 | * RT-NTD and BK-NTD: " Incremental nonnegative Tucker decomposition with block-coordinate descent and recursive approaches", in **Symmetry**, 2022, [Paper](https://www.mdpi.com/2073-8994/14/1/113), [Code](https://github.com/RafalZdunek/Incremental-NTD) 217 | 218 | * D-TuckerO: "Static and Streaming Tucker Decomposition for Dense Tensors", in **ACM Trans. Knowl. Disc. Data**, 2022, [Paper](https://dl.acm.org/doi/10.1145/3568682), [PDF](https://datalab.snu.ac.kr/~ukang/papers/dtuckerTKDD23.pdf), [Code](https://datalab.snu.ac.kr/dtucker/) 219 | 220 | * ATD: "Tracking online low-rank approximations of higher-order incomplete streaming tensors", in **Cell Patterns**, 2023, [Paper](https://www.sciencedirect.com/science/article/pii/S2666389923001046), [PDF](https://thanhtbt.github.io/files/2023_Patterns_Tensor_Tracking_Draw.pdf), [Code](https://github.com/thanhtbt/tensor_tracking) 221 | 222 | 223 | ### [Bayesian Inference Methods](#content) 224 | 225 | * SNBTD: "Streaming nonlinear Bayesian tensor decomposition", in **UAI**, 2020, [Paper](https://proceedings.mlr.press/v124/pan20a.html), [PDF](https://proceedings.mlr.press/v124/pan20a/pan20a.pdf), [Code](https://github.com/USTCEarthDefense/SNBTD) 226 | 227 | * BASS-Tucker: "Bayesian streaming sparse Tucker decomposition", in **UAI**, 2021, [Paper](https://proceedings.mlr.press/v161/fang21b.html), [PDF](https://proceedings.mlr.press/v161/fang21b/fang21b.pdf), [Code](https://github.com/xuangu-fang/Bayesian-streaming-sparse-tucker) 228 | 229 | * BCTT: "Bayesian Continuous-Time Tucker Decomposition", in **ICML**, 2022, [Paper](https://proceedings.mlr.press/v162/fang22b.html), [PDF](https://proceedings.mlr.press/v162/fang22b/fang22b.pdf), [Code](https://github.com/xuangu-fang/Bayesian-Continuous-Time-Tucker-Decomposition) 230 | 231 | 232 | ### [Multi-aspect Streaming Tucker Decomposition Methods](#content) 233 | 234 | * SIITA: "Inductive Framework for Multi-Aspect Streaming Tensor Completion with Side Information", in **ACM CIKM**, 2018, [Paper](https://dl.acm.org/doi/abs/10.1145/3269206.3271713), [PDF](https://pdfs.semanticscholar.org/99c8/b8d79ec419209513ee49274b4b7b537d3d73.pdf), [Code](https://github.com/madhavcsa/SIITA) 235 | 236 | * eOTD: "eOTD: An efficient online tucker decomposition for higher order tensors", in **IEEE ICDM**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8594989), [PDF](https://par.nsf.gov/servlets/purl/10098518) 237 | 238 | 239 | ## [Dynamic Tensor Analysis Under Tensor-Train Format](#content) 240 | 241 | ### [Dynamic Decomposition of Time-series Tensors with Fix-Size (Non-Streaming)](#content) 242 | 243 | * DATT: "Dynamical approximation by hierarchical Tucker and tensor-train tensors", in **SIAM J. Matrix Anal. Appl.**, 2013, [Paper](https://epubs.siam.org/doi/abs/10.1137/120885723), [PDF](https://www.researchgate.net/profile/Reinhold-Schneider/publication/264273502_Dynamical_Approximation_By_Hierarchical_Tucker_And_Tensor-Train_Tensors/links/54d261b40cf25017917dea17/Dynamical-Approximation-By-Hierarchical-Tucker-And-Tensor-Train-Tensors.pdf) 244 | 245 | * DATT: "Time integration of tensor trains", in **SIAM J. Numer. Anal.**, 2015, [Paper](https://epubs.siam.org/doi/abs/10.1137/140976546), [PDF](https://arxiv.org/pdf/1407.2042.pdf) 246 | 247 | 248 | ### [Incremental Decomposition of Tensors in Stationary Environments (i.e., TT-Cores are Fixed Over Time)](#content) 249 | 250 | * ITTD: "An incremental tensor-train decomposition for cyber-physical-social big data", in **IEEE Trans. Big Data**, 2018, [Paper](https://ieeexplore.ieee.org/abstract/document/8449102), [PDF](https://www.researchgate.net/profile/Liu-Huazhong/publication/327298675_An_Incremental_Tensor-Train_Decomposition_for_Cyber-Physical-Social_Big_Data/links/5cc8e492a6fdcc1d49bbfe40/An-Incremental-Tensor-Train-Decomposition-for-Cyber-Physical-Social-Big-Data.pdf) 251 | 252 | * DTT: "DTT: A highly efficient distributed tensor train decomposition method for IIoT big data", in **IEEE Trans. Ind. Inf**, 2021, [Paper](https://ieeexplore.ieee.org/document/8963751) 253 | 254 | ### [Streaming Decomposition of Tensors in Non-Stationary Environments (i.e., TT-Cores Can Change Over Time)](#content) 255 | 256 | * TT-FOA: "Adaptive Algorithms for Tracking Tensor-Train Decomposition of Streaming Tensors", in **EUSIPCO**, 2020, [Paper](https://ieeexplore.ieee.org/document/9287780), [PDF](https://hal.univ-lille.fr/hal-02865257v1/file/EUSIPCO%281%29.pdf), [Code](https://github.com/thanhtbt/ATT) 257 | 258 | * ROBOT: "Robust Tensor Tracking With Missing Data Under Tensor-Train Format", in **EUSIPCO**, 2022, [Paper](https://ieeexplore.ieee.org/document/9287780), [PDF](https://thanhtbt.github.io/files/2022_EUSIPCO-Robust%20Tensor%20Tracking%20with%20Missing%20Data%20under%20Tensor-Train%20Format.pdf), [Code](https://github.com/thanhtbt/ROBOT) 259 | 260 | 261 | * ATT: "A Novel Recursive Least-Squares Adaptive Method For Streaming Tensor-Train Decomposition With Incomplete Observations", in **Signal Process.**, 2023, [Paper](https://www.sciencedirect.com/science/article/pii/S0165168423003717), [PDF](https://thanhtbt.github.io/files/2023_SP_ATT.pdf), [Code](https://github.com/thanhtbt/ATT-miss) 262 | 263 | * STTA: "Streaming tensor train approximation", in **SIAM J. Sci. Comput.**, 2023, [Paper](https://epubs.siam.org/doi/abs/10.1137/22M1515045), [PDF](https://arxiv.org/abs/2208.02600), [Code](https://github.com/RikVoorhaar/tt-sketch) 264 | 265 | * SPTT: "Streaming probabilistic tensor train decomposition", in ArXiv, 2023, [Paper](https://arxiv.org/pdf/2302.12148.pdf) 266 | 267 | * TT-ICE: "An Incremental Tensor Train Decomposition Algorithm", in **SIAM J. Scient. Comput.**, 2024. [Paper](https://arxiv.org/pdf/2211.12487.pdf), [Code](https://github.com/dorukaks/TT-ICE) 268 | 269 | 270 | ## [Dynamic Tensor Analysis Under Block-Term Decomposition Format](#content) 271 | 272 | 273 | * OnlineBTD: "OnlineBTD: Streaming algorithms to track the block term decomposition of large tensors", in **DSAA**, 2020, [Paper](https://ieeexplore.ieee.org/abstract/document/9260061), [PDF](https://www.cs.ucr.edu/~epapalex/papers/2020_DSAA_onlineBTD.pdf), [Code](http://www.cs.ucr.edu/~egujr001/ucr/madlab/src/OnlineBTD.zip) 274 | 275 | * O-BTD-RLS: "Online rank-revealing block-term tensor decomposition", in **Signal Process.**, 2023, [Paper](https://www.sciencedirect.com/science/article/pii/S0165168423002001), [PDF](https://arxiv.org/pdf/2106.10755.pdf) 276 | 277 | * SBTD: "A Novel Tensor Tracking Algorithm For Block-Term Decomposition of Streaming Tensors", in **IEEE SSP**, 2023, [Paper](https://ieeexplore.ieee.org/document/10208007), [PDF](https://thanhtbt.github.io/files/2023_SSP%20-%20A%20novel%20tensor%20tracking%20algorithm%20for%20block-term%20decomposition%20of%20streaming%20tensors.pdf) 278 | 279 | 280 | ## [Dynamic Tensor Analysis Under T-SVD Format](#content) 281 | 282 | * TO-RPCA: "An online tensor robust PCA algorithm for sequential 2D data", in **IEEE ICASSP**, 2016, [Paper](https://ieeexplore.ieee.org/document/7472114), [PDF](https://merl.com/publications/docs/TR2016-004.pdf) 283 | 284 | * TOUCAN: "Grassmannian optimization for online tensor completion and tracking with the T-SVD", in **IEEE Trans. Signal Process.**, 2022, [Paper](https://ieeexplore.ieee.org/abstract/document/9756209), [PDF](https://arxiv.org/abs/2001.11419), [Code](https://web.eecs.umich.edu/~girasole/?p=676) 285 | * Conference version: "Online Tensor Completion and Free Submodule Tracking With The T-SVD", in **IEEE ICASSP**, 2020, [Paper](https://ieeexplore.ieee.org/abstract/document/9053199), [PDF](https://par.nsf.gov/servlets/purl/10205313), [Code](https://par.nsf.gov/servlets/purl/10205313) 286 | 287 | * "Effective streaming low-tubal-rank tensor approximation via frequent directions", in **IEEE Trans. Neural Netw. Learn. Syst.**, 2022, [Paper](https://ieeexplore.ieee.org/document/9796147), [PDF](https://arxiv.org/pdf/2108.10129.pdf) 288 | 289 | ## [Dynamic Tensor Analysis Under Tensor-Ring/Tensor Network Format](#content) 290 | 291 | * "Multi-Aspect Streaming Tensor Ring Completion for Dynamic Incremental Data", in **IEEE Signal Process. Lett.**, 2022, [Paper](https://ieeexplore.ieee.org/abstract/document/9996547) 292 | * OLSTR-SGD/RLS: "Online subspace learning and imputation by Tensor-Ring decomposition", in **Neural Netw.**, 2022, [Paper](https://www.sciencedirect.com/science/article/pii/S0893608022001976) 293 | * STRC & TRSSD: "Patch tracking-based streaming tensor ring completion for visual data recovery", in **IEEE Trans. Circuits Syst. Video Techn.**, 2022, [Paper](https://ieeexplore.ieee.org/document/9828504), [PDF](https://arxiv.org/pdf/2105.14620.pdf), [Code](https://github.com/he1c/PTSTRC) 294 | * STR: "Tracking Tensor Ring Decompositions of Streaming Tensors", in ArXiv, 2023, [Paper](https://arxiv.org/pdf/2307.00719.pdf) 295 | 296 | 297 | ## [Dynamic/Adaptive Coupled Tensor Decomposition](#content) 298 | * C-CPD-T: "An Adaptive Algorithm for Tracking Third-Order Coupled Canonical Polyadic Decomposition", in **IEEE ICASSP**, 2024, [Paper](https://ieeexplore.ieee.org/abstract/document/10447395) 299 | 300 | 301 | 302 | ## [Research Challenges, Open Problems, and Future Directions](#content) 303 | * Data Imperfection and Corruption 304 | * Non-Gaussian and Colored Noises 305 | * Outliers and Missing Data 306 | * Rank Revealing and Tracking 307 | * Efficient and Scalable Tensor Tracking 308 | * Randomized Sketching 309 | * Parallel and Distributed Computing 310 | * Neural Networks-based Methods 311 | * Provable Tensor Tracking Methods 312 | * Symbolic Tensor Tracking 313 | * Tracking under BTD, t-SVD, TN, and other variants 314 | 315 | ## [Related Sources](#content) 316 | ### [Good Surveys of (Batch) Tensor Decomposition, Analysis, and Applications](#content) 317 | 318 | * Evrim Acar et al. *"[Unsupervised multiway data analysis: A literature survey](https://ieeexplore.ieee.org/abstract/document/4538221)"*, in **IEEE TKDE**, 2008, [PDF](https://web.archive.org/web/20130328222403id_/http://www.cs.rpi.edu/research/pdf/07-06.pdf) 319 | 320 | * Tamara G. Kolda et al. *"[Tensor decompositions and applications](https://epubs.siam.org/doi/10.1137/07070111X)"*, in **SIAM Rev.**, 2009, [PDF](https://www.cs.umd.edu/class/fall2018/cmsc498V/slides/TensorBasics.pdf) 321 | 322 | * Lieven De Lathauwer et al. *"[Breaking the curse of dimensionality using decompositions of incomplete tensors: Tensor-based scientific computing in 323 | big data analysis](https://ieeexplore.ieee.org/document/6879619)"*, in **IEEE Signal Process. Mag.**, 2014, [PDF](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=925f8bc9ea8c12c398bb2473e737a67cc15cc8ad) 324 | 325 | * Andrzej Cichocki & Lieven De Lathauwer et al. *"[Tensor decompositions for signal processing applications: From two-way to multiway component analysis](https://ieeexplore.ieee.org/abstract/document/7038247)"*, in **IEEE Signal Process. Mag.**, 2015, [PDF](https://arxiv.org/pdf/1403.4462.pdf) 326 | 327 | * Andrzej Cichocki & Ivan Oseledets et al. *"[Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions](https://www.nowpublishers.com/article/Details/MAL-059)"*, in **Found. Trends Mach. Learn.**, 2016, [PDF](https://arxiv.org/abs/1609.00893) 328 | 329 | * Andrzej Cichocki & Ivan Oseledets et al. *"[Tensor networks for dimensionality reduction and large-scale optimization: Part 2 Applications and future perspectives](https://www.nowpublishers.com/article/Details/MAL-067)"*, in **Found. Trends Mach. Learn.**, 2017, [PDF](https://arxiv.org/abs/1708.09165) 330 | 331 | * Nicholas D. Sidiropoulos & Lieven De Lathauwer et al. *"[Tensor Decomposition for Signal Processing and Machine Learning](https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7891546)"*, in **IEEE Trans. Signal Process.**, 2017, [PDF](https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7891546) 332 | 333 | * Nicholas D. Sidiropoulos et al. *"[Tensors for data mining and data fusion: Models, applications, and scalable algorithms](https://dl.acm.org/doi/10.1145/2915921)"*, in **ACM Trans. Intell. Syst. Technol**, 2017, [PDF](https://web.archive.org/web/20170712024543id_/http://people.ece.umn.edu/~nikos/a16-papalexakis.pdf) 334 | 335 | * Yannis Panagakis et al. *"[Tensor methods in computer vision and deep learning](https://ieeexplore.ieee.org/document/9420085)"*, in **Proc. IEEE**, 2021, [PDF](https://arxiv.org/pdf/2107.03436.pdf) 336 | 337 | 338 | ### [Tensor Toolbox and Software](#content) 339 | #### [MATLAB](#content) 340 | * Nway-Toolbox, [Link](https://fr.mathworks.com/matlabcentral/fileexchange/1088-the-n-way-toolbox) 341 | * TensorToolbox, [Link](https://www.tensortoolbox.org/) 342 | * TensorLab, [Link](https://www.tensorlab.net/) 343 | * TensorBox, [Link](https://github.com/phananhhuy/TensorBox) 344 | * Tensor-Tensor Product Toolbox, [Link](https://github.com/canyilu/Tensor-tensor-product-toolbox/) 345 | * Splatt, [Link](https://github.com/ShadenSmith/splatt) 346 | * TT-Toolbox, [Link](https://github.com/oseledets/TT-Toolbox) 347 | * Hierarchical Tucker Toolbox, [Link](https://www.epfl.ch/labs/anchp/index-html/software/htucker/) 348 | 349 | #### [Python](#content) 350 | * TT-Toolbox, [Link](https://github.com/oseledets/ttpy) 351 | * Pyttb Toolbox, [Link](https://github.com/sandialabs/pyttb) 352 | * TensorLy, [Link](https://tensorly.org/stable/index.html) 353 | * Hottbox, [Link](https://github.com/hottbox/hottbox) 354 | * Tensorfac, [Link](https://etiennecmb.github.io/tensorpac/) 355 | * TensorD, [Link](https://tensord-v02.readthedocs.io/en/latest/introduction.html) 356 | 357 | #### [R](#content) 358 | * Tensor, [Link](https://cran.r-project.org/web/packages/tensor/index.html) 359 | * rTensor, [Link](https://cran.r-project.org/web/packages/rTensor/index.html) 360 | * nnTensor, [Link](https://cran.r-project.org/web/packages/nnTensor/index.html) 361 | * TensorBF, [Link](https://cran.r-project.org/web/packages/tensorBF/index.html) 362 | 363 | #### [Julia](#content) 364 | * TensorDecomp, [Link](https://github.com/yunjhongwu/TensorDecompositions.jl) 365 | * Tensortoolbox, [Link](https://github.com/lanaperisa/TensorToolbox.jl) 366 | * iTensor, [Link](https://scipost.org/10.21468/SciPostPhysCodeb.4) 367 | 368 | ### [Some Applications and Time-Series Datasets](#content) 369 | 370 | #### [Computer Vision](#\content) 371 | 372 | * Video/visual tracking: [ICCV 2007](https://ieeexplore.ieee.org/document/4408950), [ICCV 2015](https://www.cv-foundation.org/openaccess/content_iccv_2015_workshops/w24/html/Sobral_Online_Stochastic_Tensor_ICCV_2015_paper.html), [TPAMI 2016](https://ieeexplore.ieee.org/document/7429797), [TSP 2022](https://ieeexplore.ieee.org/document/9866940), [TNNLS 2022](https://ieeexplore.ieee.org/abstract/document/9772051) 373 | 374 | * Online video denoising: [ICCV 2017](https://openaccess.thecvf.com/content_ICCV_2017/papers/Wen_Joint_Adaptive_Sparsity_ICCV_2017_paper.pdf), [TIP 2018](https://ieeexplore.ieee.org/abstract/document/8438535) 375 | 376 | * Segmentation and Classification: [TPAMI 2008](https://ieeexplore.ieee.org/abstract/document/4378389), [SIAM JMDS 2020](https://epubs.siam.org/doi/abs/10.1137/19M1257718) 377 | 378 | * Video datasets: [Link-1](https://github.com/xiaobai1217/Awesome-Video-Datasets), [Link-2](https://paperswithcode.com/datasets?mod=videos), [Link-3](http://jacarini.dinf.usherbrooke.ca/) 379 | 380 | #### [NeuroScience](#\content) 381 | 382 | * Dynamic functional connectivity networks analysis: [TBE 2016](https://ieeexplore.ieee.org/abstract/document/7452353), [TSIPN 2017](https://ieeexplore.ieee.org/abstract/document/7852497), [Front. Neurosci. 2022](https://www.frontiersin.org/articles/10.3389/fnins.2022.861402/full) 383 | 384 | * Online EEG Completion and Analysis: [ISMICT 2018](https://ieeexplore.ieee.org/document/8573711), [TSP 2022](https://ieeexplore.ieee.org/document/9866940), [Patterns 2023](https://www.sciencedirect.com/science/article/pii/S2666389923001046) 385 | 386 | * Datasets: [Link-1](https://github.com/meagmohit/EEG-Datasets), [Link-2](https://github.com/openlists/ElectrophysiologyData), [Link-3](https://www.erpwav), [Link-4](http://fcon_1000.projects.nitrc.org/indi/retro/MPI_LEMON.html) 387 | 388 | #### [Anomaly Detection](#\content) 389 | 390 | * Sensor Networks: [KIS 2014](https://link.springer.com/article/10.1007/s10115-014-0733-3), [TNSM 2016](https://ieeexplore.ieee.org/abstract/document/7536642), [DMKD 2018](https://link.springer.com/article/10.1007/s10618-018-0560-3) 391 | 392 | * Visual anomaly detection: [TVCG 2017](https://ieeexplore.ieee.org/document/8022952) 393 | 394 | * Others: See [Survey](https://www.sciencedirect.com/science/article/pii/S0950705116000472) 395 | 396 | 397 | ## Citation 398 | If you find this repository helpful for your work, please cite 399 | 400 | [1] L.T. Thanh, K. Abed-Meraim, N. L. Trung and A. Hafiane. “[*A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition*](https://ieeexplore.ieee.org/document/9994046)”. **IEEE Trans. Knowl. Data Eng.**, 2023 [PDF](https://thanhtbt.github.io/files/2022_TKDE_A%20Contemporary%20and%20Comprehensive%20Survey%20on%20Streaming%20Tensor%20Decomposition.pdf). 401 | 402 | --------------------------------------------------------------------------------