US8239492B2 - System for content-based peer-to-peer indexing of data on a networked storage device - Google Patents
System for content-based peer-to-peer indexing of data on a networked storage device Download PDFInfo
- Publication number
- US8239492B2 US8239492B2 US12/317,153 US31715308A US8239492B2 US 8239492 B2 US8239492 B2 US 8239492B2 US 31715308 A US31715308 A US 31715308A US 8239492 B2 US8239492 B2 US 8239492B2
- Authority
- US
- United States
- Prior art keywords
- data
- topic
- peer
- order
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active, expires
Links
- 238000013500 data storage Methods 0.000 claims abstract description 16
- 238000012549 training Methods 0.000 claims description 17
- 239000013598 vector Substances 0.000 claims description 11
- 230000006855 networking Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000004422 calculation algorithm Methods 0.000 abstract description 19
- 238000004458 analytical method Methods 0.000 abstract description 4
- 238000000034 method Methods 0.000 description 22
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 4
- 238000010801 machine learning Methods 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 238000007418 data mining Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000009434 installation Methods 0.000 description 2
- 238000007635 classification algorithm Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000000875 corresponding effect Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/104—Grouping of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
Definitions
- This application relates to the field of digital data storage and techniques for providing searching and sharing access to that data, including access through a network.
- Prior art in the field consists of networked data storage devices that share data by means of a peer-to-peer protocol. These inventions allow automatic sharing of files on the device across a network, and possibly searching for shared files by the filename or file metadata.
- This invention exceeds the capabilities of the prior art primarily by means of higher-order indexing algorithms and the customization of the peer-to-peer network, which provide for sharing of not only the content but also the indexes generated with higher-order methods, whereby is provided a way of searching and sharing data that is more intuitive to human users of the invention.
- the invention consists of a data storage device, a file system for organizing data on the device, a software module providing indexing and search functions for the data on the device, software for communicating with other devices using a peer-to-peer data exchange protocol, software for performing automated backups to the device, and user interface software for controlling the functions of the system.
- An additional optional component is an HTTP server for providing a web-based user interface to any device on the network to which the invention is attached.
- the peer-to-peer protocol is specifically designed to use the output of the indexing module to provide distributed indexes and distributed search.
- the peer-to-peer software also provides complete facilities for user-level and group-level authentication and security, including permissions based on the topics generated by the indexing software. All the software and hardware elements are integrated to allow the system to function as an independent sharing and indexing node on a communications network.
- Drawing 1 is a high-level logical diagram depicting the main functional modules of the system. This diagram does not describe the embodiment of any of these modules.
- Drawing 2 is a physical diagram of the preferred embodiment of the system.
- the outermost box represents the physical housing of the unit.
- the primary external connectors for USB, Ethernet, and Power are shown on the right.
- the disk drive is represented, as well as the Printed Circuit Board (PCB) on which reside a standard processing unit with RAM, and the ROM chips containing the system's software in embedded form.
- PCB Printed Circuit Board
- Drawing 3 is a layer vertically-oriented layer diagram showing the entire software stack employed by the system, from high- to low-level. This diagram provides an enumeration of all the software modules used in the system, as well as the major interfaces between them. Vertical adjacencies in this diagram correspond to allowable interfaces between the software components in the description. Each of these interfaces is described below in the detailed description of the preferred embodiment.
- Drawings 4 and 5 show further decompositions of the two main software modules.
- Drawing 4 indicates the internal structure of the indexing software module
- Drawing 5 indicates the internal structure of the Peer-to-Peer software Module.
- Drawing 6 is a flowchart showing the procedure for the operation of indexing new data.
- Drawing 7 summarizes the process of extracting and enumerating higher-order paths from a co-occurrence graph.
- the preferred embodiment of the invention is one in which the peer-to-peer and indexing software components reside on integrated circuits mounted to a printed circuit board within the housing containing the data storage device itself.
- the data storage device consists of a commonly available hard disk drive, and will be referred to from here on as the “hard drive”.
- a version of the user interface software is also implemented in the integrated circuits within the housing, though this embodiment also has the capability of interfacing with user interface software residing on external devices.
- a file system is a specification of a method for storing, arranging, and retrieving data on a data storage device in the form of files and descriptive metadata accompanying those files. All modern file systems provide a hierarchical directory structure for organizing data on the storage device in the form of files.
- the invention contains a software component implementing a transaction-based file system for storing and retrieving data on the hard disk component. The nature of the transaction-based file system allows for multiple hosts to read and write to the hard disk simultaneously. This solves many problems related to sharing the contents of the hard disk on a network.
- this file system provides group-level security through ACLs (Access Control Lists). This means that there can be fine-grained controls at the file system level over which users, by group, have access to each file and directory on the disk. Read, write, and execute permissions can be granted independently to different groups.
- ACLs Access Control Lists
- the function of the indexing module is to examine data files and create an index of those data files by topic.
- the topic should be an accurate classification of the contents of the data file within the range of a pre-existing set of topic categories.
- files are examined for data in the form of plain text, and then that text is extracted and used to determine a topic using algorithms from the data mining field.
- One such state-of-the-art classification method is implemented, which receives additional input from the system's user interface.
- the system Upon installation of the system, the system scans the data files that the user wishes to share, randomly selects a sample of the files, and prompts the user to input the correct topic of those files.
- This sample of user-labeled data is referred to in the field of statistical machine learning as the “training set.”
- An algorithm known as the “training algorithm” uses the user-labeled data as its training set, and generates a second algorithm, called the “classification rule”, for automatically classifying data that will be written to the disk in the future.
- the combination of training algorithm and classification rule make up our classification method. Typically they are not referred to independently, but as one Statistical Machine Learning algorithm.
- the classification method used for this invention falls in the realm of Statistical Machine Learning algorithms, yet includes key advancements in the field.
- Statistical machine learning algorithms operate on flat data and traditionally assume that instances are independent and identically distributed (IID). However, this context-free approach does not exploit the available information about relationships between instances in the dataset [4].
- link mining a subset of the field of statistical relational learning, algorithms operate on relational data that includes explicit links between instances. These relations provide rich information that can be used to improve classification accuracy of learned models, since attributes of linked instances are often correlated, and links are more likely to exist between instances that have some commonality. Given a set of test instances, relational models simultaneously label all instances in order to exploit the correlations between class labels of related instances.
- the base classification algorithm used by the invention is the well-known Na ⁇ ve Bayes algorithm.
- Na ⁇ ve Bayes is commonly used in text classification because it executes quickly [10].
- the Na ⁇ ve Bayes classifier is the simplest of Bayesian classifiers in that it assumes that all attributes of the examples are independent of each other given the context of the class. Although this assumption does not hold for most real-world datasets, overall Na ⁇ ve Bayes performs fairly well.
- Traditional (or first-order) Na ⁇ ve Bayes uses documents as instances and words as the attributes. This maps directly to the method of our invention, in that the data files written to the hard disk are the documents, and the textual contents of those files, consisting either of words or of character n-grams, are the attributes.
- an ordered set of attributes (words or n-grams) is selected (commonly the union of all words found in a corpus of documents.)
- the documents are then used to create a set of training vectors, one vector for each document.
- the length of the vectors is equal to the size of the set of entities used in the classification process, and each coordinate t of the vector is either 1 or 0 indicating whether that word is present in the document.
- To each vector is appended its class C, representing the true class label of this document.
- the training process for Na ⁇ ve Bayes is at heart a probabilistic calculation using the well-known Bayes' rule. Based on the training vectors, the following set of empirical probabilities can be calculated: P ( t
- the training algorithm consists entirely of computing these quantities from the given vectors. After these probabilities are calculated, Bayes' rule gives us a rule for calculating the probability that any future encountered document d belongs to class C: P ( C
- d ) P ( d
- this probability is calculated for all classes, and the label of the class whose probability is highest is selected as the correct label.
- the training algorithm for this invention has been modified to include the higher-order relational information described above, overcoming the independence assumption.
- the higher-order information used is in the form of a second-order co-occurrence path.
- Explicit links described above can take the form of words or n-grams in common between documents. For example, if two documents share the same term, those two documents have a first-order link to each other. If two documents both have a first-order link to a third document, but not to each other, then that is a second-order link, and so on.
- the highest order of links to be used in the training process is fixed beforehand.
- the preferred embodiment of this invention uses a second-order model.
- Such a path is often referred to by the natural sequence of its vertices x 0 x 1 . . . x k . [6].
- Our definition differs from this in a couple of respects, however.
- edges may exist between given entities.
- both vertices and edges must be distinct.
- V is a finite set of vertices (i.e., entities)
- E is the set of edges representing co-occurrence relations.
- a conventional graph can nonetheless be modified to represent paths of this nature by maintaining a data structure that contains lists of records for each edge. We term this a path group. Path groups are extracted directly from the co-occurrence graph G. Using this representation, the higher-order paths correspond to a complete matching in the bipartite graph formed from the set of entities and the set of lists of records. Likewise, higher-order paths defined in this manner are the system of distinct representatives of the sets of records for each edge.
- FIG. 7 we can see an example second-order path group (e 1 - ⁇ 1,2 ⁇ -e 2 - ⁇ 1,2,4 ⁇ -e 3 ) that is extracted from the co-occurrence graph G c .
- S 1 corresponds to the records in which e 1 and e 2 co-occur
- S 2 is the set of records in which e 2 and e 3 co-occur.
- a bipartite graph G b (V 1 ⁇ V 2 , E) is formed where V 1 is the two sets of records and V 2 is the all records in these sets.
- the fourth diagram shows an example of one of the many paths in this path group.
- edge labels R 1 and R 4 are records in S 1 and S 2 and the path corresponds to the orange-colored maximum matching in the bipartite graph.
- N ⁇ 2
- N ⁇ 3
- N ⁇ 4
- the output of the categorization algorithm is an index that is partitioned into subsections called ‘topic indexes’, with one topic index containing all entries that correspond to a particular topic. As data is added to each topic index, a ‘lift’ metric is computed to measure the density and quality of data in the topic index.
- the data in the topic indexes facilitate the advanced searching and recommendation features of the system.
- Peer-to-peer (P2P) technology refers to a system that manages distributed resources to perform data sharing functions in a decentralized manner.
- the invention contains a customized software implementation of a peer-to-peer protocol that serves to automatically share the contents of the hard disk on a network to which other instances of the invention (or compatible devices) are connected.
- the peer-to-peer software is also customized to share the index data generated by the indexing software component. Through the peer-to-peer software component, the invention acts as one node, or peer, on a large network of compatible devices.
- the peer-to-peer component works by first registering the device on the network with a unique generated ID number. It contacts a server peer [28] and registers its ID with a username and password supplied by the user of the system. If the authentication process succeeds, the client will be able to continue by requesting the IDs of peers that are in the same group.
- the peer-to-peer software performs authentication and access control by means of user groups.
- the groups in the peer-to-peer network form a hierarchical structure. At the lowest level, a group is created for each individual user who is registered in the system. This provides each user full search, read, and write access for his or her own data from any remote location.
- user groups which are created by users and can be joined by an arbitrary number of other users. Such groups may have open membership (anyone who desires may join), or invitation-only, by means of a digital certificate. A single user may be a member of any number of such groups. By default, these groups offer read-only data access to the members of the group.
- At the highest level there is the “world” group, consisting of all users of the system on any reachable network.
- the underlying mechanics of the peer-to-peer protocol perform discovery and routing functions that allow any type of data to be distributed between peers on the network without recourse to a centralized server.
- the peer-to-peer software incorporates advanced techniques for providing access to networked resources which are located behind firewalls or Network Address Translation (NAT) routers.
- NAT Network Address Translation
- the peer-to-peer software contains additional capabilities allowing the device to act as a “Server Peer” on the network. This added functionality is related to data transport, discovery and routing on the peer-to-peer network. Server peers increase the reliability flexibility, and self-healing properties of the peer-to-peer network.
- the server peer functionality may be optionally activated by the end user.
- This component comprises an implementation of the lower-level set of networking protocols that allow the messages generated by the P2P protocol to be assembled into packets and transmitted across a computer network.
- the network protocols are embodied in hardware on an ASIC or set of ASICs.
- the hard disk is formatted so as to provide a separate partition for the index data.
- the indexing software runs continuously, monitoring the data that is written to the hard disk, and updating the topic indexes on disk dynamically.
- the indexing software runs on the coprocessor inside the invention's housing, for as long as the system is powered on. In this way, the indexing software works transparently in conjunction with the normal file system operations, providing a more sophisticated form of data access in real time.
- the union of a transaction-based file system with automatic indexing software represents a significant advance in the ease of use and performance of data sharing systems.
- the security model in the peer-to-peer software is closely coupled to the ACL security model of the file system.
- the single-user group in the P2P software corresponds to an individual user name in the file system
- the user groups correspond to file system groups
- the world group corresponds to the world access classification in the file system.
- the peer-to-peer software component is integrated with the indexing component in a novel way.
- the most significant feature of the integration of the peer-to-peer software with indexing is index sharing. Indexes containing data classified under a single topic (topic indexes) are shared transparently on the network, according to the demands of end-user applications and the permissions that users specify for their topic indexes.
- the permissions of each topic index can be set independently of the data itself and independently of other topic indexes.
- the user of the system can select which of their topic indexes are shared with which groups. In this way the user chooses by topic which subsets of their data are shared, rather than by file location as is typical in file-sharing applications.
- the peer-to-peer software is designed to treat index data that is transferred over the network differently from other types of data.
- Each of the “packets” (transmission units) of data transferred by the peer-to-peer protocol contain a predefined set of signature bytes that identify them as either index data or regular data. If a peer node that is used to transfer data between two other hosts sees index data in the packets it is transferring, and it has permission to read the index, it will add that index data to its own index even though the node is not the original destination for the index data. In this way the distributed index of the P2P group's data becomes more complete as the network is utilized.
- the sharing of topic indexes provides an efficient peer search method, in which all resources shared by a group can be searched.
- the indexes of that group are downloaded to the user transparently through the peer-to-peer network. This is much more efficient and robust than attempting to discover and search all shared data on the network, or than maintaining a centralized index.
- the Peer-to-Peer module forwards its messages to the network protocol module, enabling the network module to send its peer-to-peer messages to remote peer-to-peer modules transparently.
- the network module also decodes messages received from remote peer-to-peer modules and forwards them to the peer-to-peer module.
- the Graphical User Interface software is the primary means of operating the invention. Upon installation of the device, the user interface allows the user to register their device with a specific username, join various pre-existing groups, select which topic indexes are shared with which groups, to browse the files on their own devices remotely, and to search by topic or metadata on any peers to which the user has access.
- the invention also contains a firmware IP stack and HTTP server.
- a firmware IP stack and HTTP server This allows a web-based graphical user interface, as described above, to be provided to any client device on the network to which the invention is connected. This allows a high level of the invention's functionality to be accessed with no software installation necessary on a client device. This should be considered an optional component and not key to the originality or usefulness of the invention.
- the system also contains software which performs automated backups of data shared in the P2P network to which it is attached.
- the backup functionality is a use case of the P2P network's provided functionality, and so the backup software should be considered to reside at the application level.
- Any indexed shared data can be tagged for backup.
- a user can set backup tags for his or her data by folder, by index topic, or by individual file. This tag becomes part of the index of the user's data.
- the backup software retrieves all indexes in the network group and searches the index for all files tagged for backup. All tagged files are downloaded from the network and stored in a special backup archive on the hard drive.
- the backup archive preserves the device ID and the directory location of each backup file so that a complete restoration can be performed.
- the device is first plugged into a power outlet, it is connected to a network by an Ethernet cable, and the power is switched on. At this point the device automatically acquires an IP address using DHCP.
- the user uses a personal computer with a web browser to visit the web page provided by the device's web server.
- the user uses a personal computer with a web browser to visit the web page provided by the device's web server.
- the user uses the web page interface, the user creates a username and password and specifies sharing permissions for the device.
- the user can visit the web page interface, log in using the previously created username and password, and examine a summary of the index data created by the device, and alter the sharing permissions for a given topic.
- Drawing 6 contains a flowchart of the indexing process, by which data to be written to the disk is analyzed and indexed. This is an automatic operation.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
P(t|C)=(# of documents in class C including word t)/(# of documents in class C) (1)
P(C)=(# of documents in class C)/(total # of documents) (2)
P(C|d)=P(d|C)P(C) (3)
P ˜(t|C)=(# of higher-order paths in class C including word t)/(# of higher-order paths in class C) (4)
P(C)=(# of higher-order paths in class C)/(total # of higher-order paths)
N ˜2 =|A||B|−|A∩B| (10)
N ˜3 =|A||B||C|−(|A∩B||C|+|A∩C||B|+|B∩C||A|)+2|A∩B∩C| (11)
N ˜4 =|A||B||C||D|−(|A∩B||C||D|+|A∩C||B||D|+|A∩D||B||C|+|B∩C||A||D|+|B∩D||A||C|+|C∩D||A||B|)+(|A∩B||C∩D|+|A∩C||B∩D|+|A∩D||B∩C|)+2(|A∩B∩C||D|+|A∩B∩D||C|+|A∩C∩D||B|+|B∩C∩D||A|)−6(|A∩B∩C∩D|) (12)
-
- 1. All-software embodiment
In this embodiment, there is no specialized hardware at all. The indexing, P2P, and User interface software modules all run on a host device such as a PC. - 2. Only indexing is in hardware, and P2P and the user interface run on a host device. This embodiment has fewer components of the system in hardware or firmware than the preferred embodiment; only the indexing module runs on the embedded platform. This provides many of the performance advantages of the preferred embodiment, as the indexing is the software function that is most closely wedded to the file system and storage hardware.
- 3. All on One Chip
In this embodiment, a specialized dedicated ASIC is used to embody all the software functions of the system on a single chip.
- 1. All-software embodiment
- [1] B. Taskar, P. Abbeel, D. Koller, Discriminative Probabilistic Models for Relational Data, In Proceedings of Uncertainty in Artificial Intelligence conference UAI02, Edmonton, Canada, 2002
- [2] L. Getoor and C. P. Diehl, Link Mining: A Survey. SIGKDD Explorations, 7(2), 2005, 3-12
- [3] S. A. Macskassy and F. Provost, A brief survey of machine learning methods for classification in networked data and application to suspicion scoring, Workshop on Statistical Network Analysis at 23rd International Conference on Machine Learning, Pittsburgh, Pa., 2006
- [4] R. Angelova and G. Weikum, Graph-based Text Classification: Learn From Your Neighbors, SIGIR'06, August, 2006, Seattle, USA
- [5] S. Chakrabarti, B. Dom, P. Indyk, Enhanced Hypertext Classification Using Hyper-Links, In Proceedings of ACM SIGMOD Conference, 1998, pp. 307-318
- [6] J. Neville and D. Jensen, Iterative Classification in Relational Data. In Proc. AAAI-2000 Workshop on Learning Statistical Models from Relational Data, 2000, pp. 13-20
- [7] B. Taskar, E. Segal, D. Koller, Probabilistic Classification and Clustering in Relational Data. In Proc. 17th Internabonal Joint Conference on Artificial Intelligence, 2001, pp. 870-878, 2001.
- [8] Q. Lu, and L. Getoor, Link-based Classification. Proceedings of the Twentieth international conference on machine learning (ICML-2003), Washington D.C., 2003
- [9] J. Neville and D. Jensen, Dependency Networks for Relational Data, Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM'04), November 2004, pp. 170-177, Brighton, UK
- [10] J. D. M. Rennie, L. Shih, J. Teevan, D. R. Karger, Tackling the poor assumptions of naive bayes text classifiers, In Proceedings of the Twentieth International Conference on Machine Learning, 2003.
- [11] A. K. McCallum and K. Nigam. A comparison of event models for naive bayes text classification. In Working Notes of the ICMLAAAI Workshop on Learning for Text Categorization, 1998
- [12] S. Eyheramendy, D. D. Lewis, D. Madigan, On the naive Bayes model for text categorization. In Proceedings of AISTATS 2003, 9th International Workshop on Artificial Intelligence and Statistics, 2003
- [13] S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan Kaufmann, 2002.
- [14] A. Kontostathis, and W. M. Pottenger, A Framework for Understanding LSI Performance. Information Processing & Management, 42(1), 2006, pp. 56-73.
- [15] S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, R. Harshman, Indexing by latent semantic analysis. Journal of the American Society for Information Science, vol. 41, no. 6, 1990, pp. 391-407.
- [16] M. Ganiz, W. M. Poftenger, X. Yang, Link Analysis of Higher-Order Paths in Supervised Learning Datasets, In the Proceedings of the Workshop on Link Analysis, Counterterrorism and Security, 2006 SIAM Conference on Data Mining, Bethesda, Md., April 2006
- [17] M. Ganiz, W. M. Poftenger, S. Kanitkar, M. C. Chuah, Detection of Interdomain Routing Anomalies Based on Higher-Order Path Analysis. Proceedings of the Sixth IEEE International Conference on Data Mining (ICDM'06), December 2006, Hong Kong, China
- [18] P. Edmonds, Choosing the word most typical in context using a lexical co-occurrence network. In Proceedings of the Thirty-fifth Annual Meeting of the Association for Computational Linguistics, 1997, pp. 507-509.
- [19] X. Zhang, M. Berry, P. Raghavan, Level search schemes for information filtering and retrieval. Information Processing and Management 37 (2), 2000, pp. 313-334.
- [20] H. Schütze, Automatic Word Sense Discrimination. Computational Linguistics 24 (1), 1998, pp. 97-124.
- [21] J. Xu, W. B. Croft, Corpus-Based Stemming Using Co-Occurrence of Word Variants. ACM Transactions on Information Systems, 16 (1), 1998, pp. 61-81.
- [22] T. Uno, An Output Linear Time Algorithm for Enumerating Chordless Cycles, 92nd SIGAL of Information Processing Society Japan, 2003, pp. 47-53
- [23] T. Uno, Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. Lecture Notes in Computer Science, Vol. 1350. Proceedings of the 8th International Symposium on Algorithms and Computation, 1997, pp. 92-101, ISBN: 3-540-63890-3, Springer-Verlag, London, UK
- [24] J. H. Van Lint, and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1993, ISBN: 0-521-42260-4
- [25] A. McCallum, K. Nigam, J. Rennie, K. Seymore, Automating the construction of internet portals with machine learning. Information Retrieval, 3, 2000, pp. 127-163.
- [26] C. L. Giles, K. Bollacker, S. Lawrence, CiteSeer: An automatic citation indexing system, ACM Digital Libraries 98, 1998
- [27] P. Sen, and L. Getoor, Link-based Classification. University of Maryland Technical Report, Number CS-TR-4858, February 2007
- [28] Intuidex Inc., “Peer-to-Peer Indexing-Based Marketplace”, provisional patent 61/008,405 filed Dec. 20, 2007.
- [29] Intuidex Inc., “System for Content-Based Peer-to-Peer Indexing of Data on a Networked Storage Device”, provisional patent 61/008,404 filed Dec. 20, 2007.
- [30] Intuidex Inc., “Social Networking on a Website with Topic-Based Data Sharing”, provisional patent 61/008,399 filed Dec. 20, 2007.
Claims (13)
P(C|d)=P(d|C)P(C), and
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/317,153 US8239492B2 (en) | 2007-12-20 | 2008-12-19 | System for content-based peer-to-peer indexing of data on a networked storage device |
US12/797,366 US8572071B2 (en) | 2008-12-19 | 2010-06-09 | Systems and methods for data transformation using higher order learning |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US840407P | 2007-12-20 | 2007-12-20 | |
US12/317,153 US8239492B2 (en) | 2007-12-20 | 2008-12-19 | System for content-based peer-to-peer indexing of data on a networked storage device |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/317,134 Continuation-In-Part US8301768B2 (en) | 2007-12-20 | 2008-12-19 | Peer-to-peer indexing-based marketplace |
Publications (2)
Publication Number | Publication Date |
---|---|
US20090177757A1 US20090177757A1 (en) | 2009-07-09 |
US8239492B2 true US8239492B2 (en) | 2012-08-07 |
Family
ID=40845457
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/317,153 Active 2030-02-05 US8239492B2 (en) | 2007-12-20 | 2008-12-19 | System for content-based peer-to-peer indexing of data on a networked storage device |
Country Status (1)
Country | Link |
---|---|
US (1) | US8239492B2 (en) |
Cited By (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160156644A1 (en) * | 2011-05-24 | 2016-06-02 | Palo Alto Networks, Inc. | Heuristic botnet detection |
US9762608B1 (en) | 2012-09-28 | 2017-09-12 | Palo Alto Networks, Inc. | Detecting malware |
US9800659B2 (en) | 2015-02-02 | 2017-10-24 | International Business Machines Corporation | Enterprise peer-to-peer storage and method of managing peer network storage |
US9804869B1 (en) | 2013-07-30 | 2017-10-31 | Palo Alto Networks, Inc. | Evaluating malware in a virtual machine using dynamic patching |
US9805193B1 (en) | 2014-12-18 | 2017-10-31 | Palo Alto Networks, Inc. | Collecting algorithmically generated domains |
US9882906B2 (en) | 2014-12-12 | 2018-01-30 | International Business Machines Corporation | Recommendation schema for storing data in a shared data storage network |
US9942251B1 (en) | 2012-09-28 | 2018-04-10 | Palo Alto Networks, Inc. | Malware detection based on traffic analysis |
US10013682B2 (en) | 2015-02-13 | 2018-07-03 | International Business Machines Corporation | Storage and recovery of digital data based on social network |
US10019575B1 (en) | 2013-07-30 | 2018-07-10 | Palo Alto Networks, Inc. | Evaluating malware in a virtual machine using copy-on-write |
US10152597B1 (en) | 2014-12-18 | 2018-12-11 | Palo Alto Networks, Inc. | Deduplicating malware |
US10204221B2 (en) | 2014-07-14 | 2019-02-12 | Palo Alto Networks, Inc. | Detection of malware using an instrumented virtual machine environment |
US10867041B2 (en) | 2013-07-30 | 2020-12-15 | Palo Alto Networks, Inc. | Static and dynamic security analysis of apps for mobile devices |
US10956573B2 (en) | 2018-06-29 | 2021-03-23 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11010474B2 (en) | 2018-06-29 | 2021-05-18 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11196765B2 (en) | 2019-09-13 | 2021-12-07 | Palo Alto Networks, Inc. | Simulating user interactions for malware analysis |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1914643A1 (en) * | 2006-10-19 | 2008-04-23 | Motorola, Inc. | Method and apparatus for filtering peer-to-peer network searches for limited capability devices |
US8301768B2 (en) * | 2007-12-20 | 2012-10-30 | Pottenger William M | Peer-to-peer indexing-based marketplace |
US8234310B2 (en) * | 2007-12-20 | 2012-07-31 | Pottenger William M | Social networking on a website with topic-based data sharing |
CN101729442B (en) * | 2008-10-23 | 2013-03-20 | 华为技术有限公司 | Method and device for realizing content sharing |
US8572071B2 (en) * | 2008-12-19 | 2013-10-29 | Rutgers, The State University Of New Jersey | Systems and methods for data transformation using higher order learning |
US8738673B2 (en) | 2010-09-03 | 2014-05-27 | International Business Machines Corporation | Index partition maintenance over monotonically addressed document sequences |
US20130013680A1 (en) * | 2011-07-07 | 2013-01-10 | International Business Machines Corporation | System and method for determining interpersonal relationship influence information using textual content from interpersonal interactions |
US11226990B2 (en) * | 2018-07-20 | 2022-01-18 | Ionir Systems Ltd. | System and method for operating a digital storage system |
WO2020251155A1 (en) | 2019-06-13 | 2020-12-17 | Samsung Electronics Co., Ltd. | An automated system for healing faulty node in a network and method thereof |
US11768954B2 (en) | 2020-06-16 | 2023-09-26 | Capital One Services, Llc | System, method and computer-accessible medium for capturing data changes |
Citations (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020069056A1 (en) | 2000-12-05 | 2002-06-06 | Nofsinger Charles Cole | Methods and systems for generating documents from voice interactions |
US20020078062A1 (en) * | 1999-08-13 | 2002-06-20 | Fujitsu Limited | File processing method, data processing apparatus and storage medium |
US20030191828A1 (en) | 2002-04-09 | 2003-10-09 | Ramanathan Murali Krishna | Interest-based connections in peer-to-peer networks |
US20030236861A1 (en) * | 2000-03-03 | 2003-12-25 | Johnson Scott C. | Network content delivery system with peer to peer processing components |
US20040024848A1 (en) * | 1999-04-02 | 2004-02-05 | Microsoft Corporation | Method for preserving referential integrity within web sites |
US6901398B1 (en) | 2001-02-12 | 2005-05-31 | Microsoft Corporation | System and method for constructing and personalizing a universal information classifier |
US7117437B2 (en) | 2002-12-16 | 2006-10-03 | Palo Alto Research Center Incorporated | Systems and methods for displaying interactive topic-based text summaries |
US20060282309A1 (en) | 2005-06-08 | 2006-12-14 | Microsoft Corporation | Peer-to-peer advertisement platform |
US20070168469A1 (en) * | 2006-01-17 | 2007-07-19 | Microsoft Corporation | Server side search with multi-word word wheeling and wildcard expansion |
US20070211651A1 (en) | 2006-03-13 | 2007-09-13 | Ebay Inc. | Peer-to-peer trading platform with roles-based transactions |
US7328216B2 (en) | 2000-07-26 | 2008-02-05 | Recommind Inc. | System and method for personalized search, information filtering, and for generating recommendations utilizing statistical latent class models |
US7337181B2 (en) * | 1999-07-30 | 2008-02-26 | Microsoft Corporation | Methods for routing items for communications based on a measure of criticality |
US20080080393A1 (en) | 2006-09-29 | 2008-04-03 | Microsoft Corporation | Multiple peer groups for efficient scalable computing |
US20090125637A1 (en) | 2007-11-09 | 2009-05-14 | Nokia Corporation | Method, Apparatus and Computer Program Product for Providing Data Management in a P2P Network |
US20090164475A1 (en) | 2007-12-20 | 2009-06-25 | Pottenger William M | Social networking on a website with topic-based data sharing |
US20090177728A1 (en) | 2007-12-20 | 2009-07-09 | Pottenger William M | Peer-to-peer indexing-based marketplace |
US7617370B2 (en) * | 2005-04-29 | 2009-11-10 | Netapp, Inc. | Data allocation within a storage system architecture |
US7634466B2 (en) | 2005-06-28 | 2009-12-15 | Yahoo! Inc. | Realtime indexing and search in large, rapidly changing document collections |
US7664742B2 (en) | 2005-11-14 | 2010-02-16 | Pettovello Primo M | Index data structure for a peer-to-peer network |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7174362B1 (en) * | 2000-11-21 | 2007-02-06 | Sungil Lee | Method and system for supplying products from pre-stored digital data in response to demands transmitted via computer network |
-
2008
- 2008-12-19 US US12/317,153 patent/US8239492B2/en active Active
Patent Citations (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040024848A1 (en) * | 1999-04-02 | 2004-02-05 | Microsoft Corporation | Method for preserving referential integrity within web sites |
US7392303B2 (en) | 1999-04-02 | 2008-06-24 | Microsoft Corporation | Method for preserving referential integrity within web sites |
US7337181B2 (en) * | 1999-07-30 | 2008-02-26 | Microsoft Corporation | Methods for routing items for communications based on a measure of criticality |
US20020078062A1 (en) * | 1999-08-13 | 2002-06-20 | Fujitsu Limited | File processing method, data processing apparatus and storage medium |
US20030236861A1 (en) * | 2000-03-03 | 2003-12-25 | Johnson Scott C. | Network content delivery system with peer to peer processing components |
US7328216B2 (en) | 2000-07-26 | 2008-02-05 | Recommind Inc. | System and method for personalized search, information filtering, and for generating recommendations utilizing statistical latent class models |
US20020069056A1 (en) | 2000-12-05 | 2002-06-06 | Nofsinger Charles Cole | Methods and systems for generating documents from voice interactions |
US6901398B1 (en) | 2001-02-12 | 2005-05-31 | Microsoft Corporation | System and method for constructing and personalizing a universal information classifier |
US20030191828A1 (en) | 2002-04-09 | 2003-10-09 | Ramanathan Murali Krishna | Interest-based connections in peer-to-peer networks |
US7174382B2 (en) | 2002-04-09 | 2007-02-06 | Hewlett-Packard Development Company, L.P. | Interest-based connections in peer-to-peer networks |
US7117437B2 (en) | 2002-12-16 | 2006-10-03 | Palo Alto Research Center Incorporated | Systems and methods for displaying interactive topic-based text summaries |
US7617370B2 (en) * | 2005-04-29 | 2009-11-10 | Netapp, Inc. | Data allocation within a storage system architecture |
US20060282309A1 (en) | 2005-06-08 | 2006-12-14 | Microsoft Corporation | Peer-to-peer advertisement platform |
US7634466B2 (en) | 2005-06-28 | 2009-12-15 | Yahoo! Inc. | Realtime indexing and search in large, rapidly changing document collections |
US7664742B2 (en) | 2005-11-14 | 2010-02-16 | Pettovello Primo M | Index data structure for a peer-to-peer network |
US20070168469A1 (en) * | 2006-01-17 | 2007-07-19 | Microsoft Corporation | Server side search with multi-word word wheeling and wildcard expansion |
US7769804B2 (en) | 2006-01-17 | 2010-08-03 | Microsoft Corporation | Server side search with multi-word word wheeling and wildcard expansion |
US20070211651A1 (en) | 2006-03-13 | 2007-09-13 | Ebay Inc. | Peer-to-peer trading platform with roles-based transactions |
US20080080393A1 (en) | 2006-09-29 | 2008-04-03 | Microsoft Corporation | Multiple peer groups for efficient scalable computing |
US20090125637A1 (en) | 2007-11-09 | 2009-05-14 | Nokia Corporation | Method, Apparatus and Computer Program Product for Providing Data Management in a P2P Network |
US20090177728A1 (en) | 2007-12-20 | 2009-07-09 | Pottenger William M | Peer-to-peer indexing-based marketplace |
US20090164475A1 (en) | 2007-12-20 | 2009-06-25 | Pottenger William M | Social networking on a website with topic-based data sharing |
Non-Patent Citations (33)
Title |
---|
"Vimeo" by Internet Archive WayBackMachine, dated from Jun. 2, 2007, pp. 1-6. |
Angelova, R. et al., "Graph-based Text Classification: Learn From Your Neighbors", SIGIR '06, Aug. 2006, Seattle, USA, pp. 485-492. |
Chakrabarti, S. et al., "Enhanced Hypertext Classification Using Hyper-Links", In Proceedings of ACM SIGMOD Conference, 1998, pp. 307-318. |
Deerwester, S. et al., "Indexing by latent semantic analysis", Journal of the American Society for Information Science, vol. 41, No. 6, 1990, pp. 391-407. |
Edmonds, P., "Choosing the word most typical in context using a lexical co-occurrence network", In Proceedings of the Thirty-fifth Annual Meeting of the Association for Computational Linguistics, 1997, pp. 507-509. |
Eyheramendy, S. et al., "On the naive Bayes model for text categorization" In Proceedings of AISTATS 2003, 9th International Workshop on Artificial Intelligence and Statistics, 2003. |
Ganiz, M. et al., "Detection of Interdomain Routing Anomalies Based on Higher-Order Path Analysis", Proceedings of the Sixth IEEE International Conference on Data Mining (ICDM'06), Dec. 2006, Hong Kong, China. |
Ganiz, M. et al., "Link Analysis of Higher-Order Paths in Supervised Learning Datasets", In the Proceedings of the Workshop on Link Analysis, Counterterrorism and Security, 2006 SIAM Conference on Data Mining, Bethesda, Md., Apr. 2006. |
Getoor, L. et al., "Link Mining: A Survey", SIGKDD Explorations, vol. 7, No. 2, 2005, pp. 3-12. |
Giles, C.L. et al., "CiteSeer: An automatic citation indexing system", ACM Digital Libraries 98, 1998, Third ACM Conference on Digital Libraries, Ed. Witten, I. et al., ACM Press, New York, pp. 89-98. |
Kontostathis, A. et al., "A Framework for Understanding LSI Performance", Information Processing & Management, vol. 42, No. 1, 2006, pp. 56-73. |
Lu, Q. et al., "Link-based Classification", Proceedings of the Twentieth international conference on machine learning (ICML-2003), Washington D.C., 2003, pp. 496-503. |
MacSkassy, S.A. et al., A Brief Survey of Machine Learning Methods for Classification in Networked Data and Application to Suspicion Scoring, Workshop on Statistical Network Analysis at 23rd International Conference on Machine Learning, Pittsburgh, Pa., 2006. |
McCallum, A.K. et al., "A comparison of event models for naive bayes text classification", In Working Notes of the ICMLAAAI Workshop on Learning for Text Categorization, 1998. |
McCallum, A.K. et al., "Automating the construction of internet portals with machine learning", Information Retrieval, vol. 3, 2000, pp. 127-163. |
Neville, J. et al., "Dependency Networks for Relational Data", Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM'04), Nov. 2004, pp. 170-177, Brighton, UK. |
Neville, J. et al., "Iterative Classification in Relational Data", In Proc. AAAI-2000 Workshop on Learning Statistical Models from Relational Data, 2000, pp. 42-49. |
Official Action from the United States Patent and Trademark Office for U.S. Appl. No. 12/317,152 dated Nov. 10, 2011. |
Official Action issued in connection with U.S. Appl. No. 12/317,134 mailed Apr. 13, 2010. |
Official Action issued in connection with U.S. Appl. No. 12/317,134 mailed Jun. 28, 2011. |
Official Action issued in connection with U.S. Appl. No. 12/317,134 mailed Oct. 7, 2010. |
Official Action issued in connection with U.S. Appl. No. 12/317,152 mailed Dec. 21, 2010. |
Official Action issued in connection with U.S. Appl. No. 12/317,152 mailed Jun. 22, 2011. |
Rennie, J.D.M. et al., "Tackling the poor assumptions of naive bayes text classifiers", In Proceedings of the Twentieth International Conference on Machine Learning, 2003. |
Sarawagi, S. et al., "Cross-Training: Learning Probabilistic Mappings Between Topics", SIGKDD '03, 2003, Washington, DC, USA. |
Schutze, H., "Automatic Word Sense Discrimination", Computational Linguistics, vol. 24, No. 1, 1998, pp. 97-124. |
Sen, P. et al., "Link-based Classification", University of Maryland Technical Report, No. CS-TR-4858, Feb. 2007. |
Taskar, B. et al, "Discriminative Probabilistic Models for Relational Data", In Proceedings of Uncertainty in Artificial Intelligence Conference UAI02, Edmonton, Canada, 2002. |
Taskar, B. et al., "Probabilistic Classification and Clustering in Relational Data", In Proc. 17th Internabonal Joint Conference on Artificial Intelligence, 2001, pp. 870-878, 2001. |
Uno, T., "Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs", Lecture Notes in Computer Science, vol. 1350. Proceedings of the 8th International Symposium on Algorithms and Computation, 1997, pp. 92-101, ISBN: 3-540-63890-3, Springer-Verlag, London, UK. |
Uno, T., "An Output Linear Time Algorithm for Enumerating Chordless Cycles", 92nd SIGAL of Information Processing Society Japan, 2003, pp. 47-53. |
Xu, J. et al., "Corpus-Based Stemming Using Co-Occurrence of Word Variants", ACM Transactions on Information Systems, vol. 16, No. 1, 1998, pp. 61-81. |
Zhang, X. et al., "Level search schemes for information filtering and retrieval", Information Processing and Management, vol. 37, No. 2, 2000, pp. 313-334. |
Cited By (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9762596B2 (en) * | 2011-05-24 | 2017-09-12 | Palo Alto Networks, Inc. | Heuristic botnet detection |
US20160156644A1 (en) * | 2011-05-24 | 2016-06-02 | Palo Alto Networks, Inc. | Heuristic botnet detection |
US9762608B1 (en) | 2012-09-28 | 2017-09-12 | Palo Alto Networks, Inc. | Detecting malware |
US9942251B1 (en) | 2012-09-28 | 2018-04-10 | Palo Alto Networks, Inc. | Malware detection based on traffic analysis |
US10867041B2 (en) | 2013-07-30 | 2020-12-15 | Palo Alto Networks, Inc. | Static and dynamic security analysis of apps for mobile devices |
US9804869B1 (en) | 2013-07-30 | 2017-10-31 | Palo Alto Networks, Inc. | Evaluating malware in a virtual machine using dynamic patching |
US10678918B1 (en) | 2013-07-30 | 2020-06-09 | Palo Alto Networks, Inc. | Evaluating malware in a virtual machine using copy-on-write |
US10019575B1 (en) | 2013-07-30 | 2018-07-10 | Palo Alto Networks, Inc. | Evaluating malware in a virtual machine using copy-on-write |
US10204221B2 (en) | 2014-07-14 | 2019-02-12 | Palo Alto Networks, Inc. | Detection of malware using an instrumented virtual machine environment |
US10515210B2 (en) | 2014-07-14 | 2019-12-24 | Palo Alto Networks, Inc. | Detection of malware using an instrumented virtual machine environment |
US9882906B2 (en) | 2014-12-12 | 2018-01-30 | International Business Machines Corporation | Recommendation schema for storing data in a shared data storage network |
US11036859B2 (en) | 2014-12-18 | 2021-06-15 | Palo Alto Networks, Inc. | Collecting algorithmically generated domains |
US9805193B1 (en) | 2014-12-18 | 2017-10-31 | Palo Alto Networks, Inc. | Collecting algorithmically generated domains |
US10846404B1 (en) | 2014-12-18 | 2020-11-24 | Palo Alto Networks, Inc. | Collecting algorithmically generated domains |
US10152597B1 (en) | 2014-12-18 | 2018-12-11 | Palo Alto Networks, Inc. | Deduplicating malware |
US9800659B2 (en) | 2015-02-02 | 2017-10-24 | International Business Machines Corporation | Enterprise peer-to-peer storage and method of managing peer network storage |
US10026067B2 (en) | 2015-02-13 | 2018-07-17 | International Business Machines Corporation | Storage and recovery of digital data based on social network |
US10013682B2 (en) | 2015-02-13 | 2018-07-03 | International Business Machines Corporation | Storage and recovery of digital data based on social network |
US10956573B2 (en) | 2018-06-29 | 2021-03-23 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11010474B2 (en) | 2018-06-29 | 2021-05-18 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11604878B2 (en) | 2018-06-29 | 2023-03-14 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11620383B2 (en) | 2018-06-29 | 2023-04-04 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11960605B2 (en) | 2018-06-29 | 2024-04-16 | Palo Alto Networks, Inc. | Dynamic analysis techniques for applications |
US11196765B2 (en) | 2019-09-13 | 2021-12-07 | Palo Alto Networks, Inc. | Simulating user interactions for malware analysis |
US11706251B2 (en) | 2019-09-13 | 2023-07-18 | Palo Alto Networks, Inc. | Simulating user interactions for malware analysis |
Also Published As
Publication number | Publication date |
---|---|
US20090177757A1 (en) | 2009-07-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8239492B2 (en) | System for content-based peer-to-peer indexing of data on a networked storage device | |
US8234310B2 (en) | Social networking on a website with topic-based data sharing | |
US8301768B2 (en) | Peer-to-peer indexing-based marketplace | |
US20210397653A1 (en) | Method and system for identifying and discovering relationships between disparate datasets from multiple sources | |
US8688673B2 (en) | System for communication and collaboration | |
US8099429B2 (en) | Relational linking among resoures | |
Broekstra13 et al. | A metadata model for semantics-based peer-to-peer systems | |
US20080005086A1 (en) | Certificate-based search | |
US9189539B2 (en) | Electronic content curating mechanisms | |
US20080082782A1 (en) | Location management of off-premise resources | |
AU2016311039A1 (en) | Methods and systems for identifying a level of similarity between a filtering criterion and a data item within a set of streamed documents | |
US20140059089A1 (en) | Method and apparatus for structuring a network | |
US7861154B2 (en) | Integration of annotations to dynamic data sets | |
Rodriguez-Prieto et al. | Discovering related scientific literature beyond semantic similarity: a new co-citation approach | |
Cui et al. | Improving image annotation via ranking‐oriented neighbor search and learning‐based keyword propagation | |
Wen et al. | Crossing scientific workflow fragments discovery through activity abstraction in smart campus | |
US20210166331A1 (en) | Method and system for risk determination | |
Raghavan et al. | Eliciting file relationships using metadata based associations for digital forensics | |
Mahboob et al. | Swallow: resource and tag recommender system based on heat diffusion algorithm in social annotation systems | |
US12112365B2 (en) | Probabilistic determination of compatible content | |
US20060080288A1 (en) | Interaction of static and dynamic data sets | |
Nair et al. | Folksonomy-based ad hoc community detection in online social networks | |
Banks et al. | The ePerson snippet manager: a semantic web application | |
US10394761B1 (en) | Systems and methods for analyzing and storing network relationships | |
Nguyen et al. | Handling imbalanced classification problem: A case study on social media datasets |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: INTUIDEX, INC., PENNSYLVANIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:POTTENGER, WILLIAM M.;REEL/FRAME:028732/0899 Effective date: 20120624 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2552); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2553); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY Year of fee payment: 12 |